The maximum gate delay for any output to appear in an array multiplier for multiplying two n bit number is

Suppose we want to arrange the n numbers stored in any array such that all negative values occur before all positive ones. Minimum number of exchanges required in the worst case is

The number of articulation points of the following graph is

A sorting technique is called stable if: