Write a program in C# on this pseudo code, heap sort, the code must be complete and identical to the pseudo code and with a screenshot of the OUTPUT, write code in c#

Procedures on Heap Heapify(A, i) { Lleft(i) (using 2i+1) Rt right(i) (using 2i+2) if LA[i] then largest EL else largesti if R A[largest] then largest R if largest != i then swap A[i] A[largest] Heapify(A, largest) } Buildheap(A) { Heapsize flength[A] for it Heapsize / 2 down to do Heapify(A, i) } Heapsort(A) { Buildheap A) for it length[A]-1 down to 0 do swap A[O] A[i] heapsize[A] + heapsize[A] - 1 Heapify(A, 0)