3. [X points) Below is a pseudocode for a recursive algorithm that locates a min element in an array or a list). (Please note that indexing of the list/array starts from 1 in this pseudocode given below.) Algorithm min(a[1], [2],...a[n]) Linel: { if n=1 Line2: return a[1] Line3: m-min(a[1], a[2]......a[n-1]) Line4: if m> a[n] Line5: return a[n] Line6: else Line 7 return m} Below is the incomplete recurrence for the min algorithm, fill in the blanks where indicated below. n=1 Tw)= T(n)=3 > n=1 - n>1/