6 [10 Points] Setup a recurrence relation for the following recursive function and solve it. func (A[O..N-1]) if (N == 1) return A[0]; else { temp = func (A[O..N-2]); if (temp 3 A[N-1]) return temp; else return A[N-1]