Question 3. A sequence of n integers is given. Sequence A for the following questions Design an algorithm that runs at O (n) runtime without using any other sequences, and Write the pseudo-codes of the algorithms. (Your algorithms that do not provide restrictions will get 5 points each will be evaluated over.)

a) (15 points) There is no 0 among the elements of array A. The elements of this array are change so that negative numbers come before all positive numbers.

b) (15 points) The elements of array A are replaced by negative numbers first, then zeros, then change to positive numbers.