Draw the "execution trace tree" of Quicksort when the input array has ? elements in REVERSE sorted order, that is when the input array is: G, F, E, D, C, B,A Your tree should be similar to the one shown in the class notes, that is every node in the tree should indicate the value of the parameters LEFT and RlGHT, and also the value of the local variable PIVOT_PDSITEON for that call to the quicksort function. The quicksort code is posted, as usual, on our Unix host machine. HlNT: You should see a pattern in the shape of the execution trace tree. You should be able to quckly draw the shape of the tree if n was 100, instead of 7. Upload your drawing here. Include in your document a DISCUSSION of how much time, in general bigO terms, will Quicksort take to execute when the given input array of n data items is in REVERSE sorted order