Consider the problem of finding the position of the maximumelement in array of integers.

1. Write (in pseudocode) a brute-force algorithm to find theposition of the maximum

element of an array of integers usingloops.

2. Convert your algorithm in part a by using recursive algorithminstead of loops and without using any global variables.
3. Calculate the time complexity of your algorithm in part a andb.