Turn the following psuedo into a real c# code:

1. Understand the algorithm being analysed. Your must briefly describe the algorithm.

2. Expain the algorithms predicted (theoretical) average-case efficiency with respect to its basic operation.

3. Explain clearly the choice of basic operation for the particular algorithm of interest.

4. Summarise the expected time efficiency of the algorithm with respect to the size of its input(s). This should be expressed as the algorithms predicted average-case efficiency and/or order of growth.

Algorithm NegBeforePos(A[0..n -1]) // Puts negative elements before positive (and zeros, if any) in an array //Input: Array A(0..n - 1] of real numbers //Output: Array A[0..n -1] in which all its negative elements precede nonnegative j do Ii