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

• A. n - 1
• B. n
• C. n + 1
• D. none of the above