Consider the following Treap $($that is utilizing the max$-$heap property$).$ The top numerical value represents the key$/$value and the bottom numerical value represents the priority,

Let's say the key$/$value to be removed is $11,$ how many rotations will the Treap perform until the value is successfully removed. Select the correct answer choice below.

$0$

$1$

$2$

$3$

$4$

$5$

$6$

None of these choices