Draw a decision tree for the following partition algorithm operating on the following four elements A, B, C, and D. Please note that in each internal node of your decision tree you should indicate a comparison of two elements (ex C <= D).

Code is:

Partition (A, p, r)

pivot = A[r]

i = p 1

for j = p to r-1

---------if A[j] < pivot

-------------------i = i+1

--------------------Exchange A[i] and A[j]

Exchange A[i+1] and A[r]

return( i+1)