3. The mode of an array A(1: n) is the most frequently repeated element. The following very elegant iterative algorithm computes the mode and its frequency in an ordered array A. algorithm mode (A, n, m, f) // mode m and its frequency f in an ordered array A(1:n) m+ A(1), f= 1 for i= 2 to n do if A(i) = A(i f) then m A(i), ff+1 endif endfor What is the complexity of the above algorithm? Write a pseudocode for the recursive version of the above algorithm model (A, i, m, f) which computes the mode m and its frequency f in an ordered array A(1: i) where I sisn. Obtain the complexity of the algorithm