With the algorithm given, draw the recursion tree for inputs A=[10,3,9,4,8,5,7,6], p=1, r=8, k=2

At each nonbase case node show 1) values of all parameters: input array A, p,r, k 2) A after partition

At each base case mode show values of all parameter array A, p, r, and k

Beside each downward arrow connecting a parent execution to a child recursive execution, show the value returned upwards by the child execution

Par-clarhogrending indcx fand kith smallest if perthen return Atp Paut that A, fi r ) k pivG DIstanta then rehan Atal else if kpivoHistaneten else Draw therecarsionheef this algorthm for Areach non-base cas e node shodallof th following , tivalne otall paraneler lie agy atp res)-: 2) faoftev pavnition Besides each downwaxd cunovw pavent fxecution to a child shew the value retumet up nnactin a