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