Turn the following into working C# code within a single class. The algorithm should return the median number within an array.

ALGORITHM Median(A[0..n - 11) // Returns the median value in a given array A of n numbers. if n= 1 then return A[0] else Select(A, 0, Ln/2^, n-1) I/NB: The third argument is rounded down ALGORITHM Select(A[0..n-1], l, m, h) // Returns the value at index m in array slice A[l..h], if the slice // were sorted into nondecreasing order. pos ? Partition(A, l, h) if pos= m then return A[pos] return Select(A, I, m, pos -1) return Select(A, pos 1, m, h) if pos > m then if pos