a. (2 marks) Consider the following program: Smallest (A, f, l) **Precondition: A[f..] is an array...

Transcribed Image Text:

a. (2 marks) Consider the following program: Smallest (A, f, l) **Precondition: A[f..] is an array of integers, l and f,l N. **Postcondition: Returns the smallest element of A[..l]. if f = 1 then return A[f] else m = [+1] return min(Smallest (A, f, m), Smallest (A, m + 1,1)) end if Write a recurrence relation that describes the time complexity of this program in terms of the size of array A and solve it. b. (2 marks) Show the result after each operation below, starting on an NIL BST: Insert (16), Insert (4), Insert (3), Insert (9), Insert (1), Insert (44), Insert (29), Delete (1), Delete (4), Insert (34). a. (2 marks) Consider the following program: Smallest (A, f, l) **Precondition: A[f..] is an array of integers, l and f,l N. **Postcondition: Returns the smallest element of A[..l]. if f = 1 then return A[f] else m = [+1] return min(Smallest (A, f, m), Smallest (A, m + 1,1)) end if Write a recurrence relation that describes the time complexity of this program in terms of the size of array A and solve it. b. (2 marks) Show the result after each operation below, starting on an NIL BST: Insert (16), Insert (4), Insert (3), Insert (9), Insert (1), Insert (44), Insert (29), Delete (1), Delete (4), Insert (34).