(10 points) Basic. Decision tree for Selection-Sort. Selection-Sort (A) n A. length For j 1 to n -1 Do smallest i For i j 1 to n Do if A Oil A[smallest] en smallest i Exchange A [j] with A Dsmallest] (a) (6 points) Draw the decision tree corresponding to Selection-Sort when running on an array of n 3 elements A 3 a1, a2, a3) as in fig. 8.1 (keep "S" on the left child and on the right child). (b) (2 points) Mark the execution path followed for the array A (6,4, 2), as in fig. 8.1. (c) (2 points For the tree you drew, how many leaves does it have? Compare this with n! and comment on the result