Exercise 3: decision tree for comparison sorts (15 points). Consider the SEleCTioN-SorT(A) algorithm (exercise 2.2-2 in the book), using the following pseudocode SeLeCTION-SorT(A) l n-A. length 2 for j 1 to n -1 smallest for i-j +1 to n if Ali " on the right child). 2. (2 points) Mark the execution path followed for the array A- 6,4,2), as in fig. 8.1. 3. (2 points) For the tree you drew, what is the depth for the best and worst cases? Comment on 1. (3 points) For a tree corresponding to an array with n elements, what would be the depth for the 5. (3 points) For the tree you drew, how many leaves does it have? Compare this with n! and the resul best and worst cases? Comment on the result. comment on the result. Exercise 3: decision tree for comparison sorts (15 points). Consider the SEleCTioN-SorT(A) algorithm (exercise 2.2-2 in the book), using the following pseudocode SeLeCTION-SorT(A) l n-A. length 2 for j 1 to n -1 smallest for i-j +1 to n if Ali " on the right child). 2. (2 points) Mark the execution path followed for the array A- 6,4,2), as in fig. 8.1. 3. (2 points) For the tree you drew, what is the depth for the best and worst cases? Comment on 1. (3 points) For a tree corresponding to an array with n elements, what would be the depth for the 5. (3 points) For the tree you drew, how many leaves does it have? Compare this with n! and the resul best and worst cases? Comment on the result. comment on the result