Can you do coding for D please

D. 2 points-Suppose you want to find the largest entry in an unsorted array of n entries. Algorithm A searches the entire array sequentially and records the largest entry seen so far. Algorithm B sorts the array into descending order and then reports the first entry as the largest. Compare the time efficiency of the two approaches. The azray is initially 1234 3 4512 E. 10 points Consider ann by n array of integer values. Write an algorithm to sort the rows of the array by their first value. 4231