2. Design an algorithm to rearrange elements of a given array of n real numbers so that all its negative elements precede all its positive elements. Your algorithm should be both time efficient and space efficient. (Hint: use the partition idea similar to that of Quicksort)

[20 points] Find the order of growth using master theorem. (a) T(n) = 2T(n/2) + 1, (b) T(n)= 2T(n/2)+n, (c) T(n) = 2T(n/2) + n", (D) T(n) = 4T(n/2) + n", 1. T(1) = 1 T(1)=1 T(1) = 1 T(1) =