$(8$ points$)$ Consider the following well$-$known randomized recursive divide$-$and$-$conquer algorithm for printing a list of values in sorted order.Give all answers in big$-$O notation.$($a$)$ How many levels does the recursive call tree have in expectation?$($b$)$ How many total operations are there at each level of recursion $($across all recursive calls at a given level$)?$