$)$ Describe how a priority search tree can be used to determine all intervals $[$i$,$ j$]$ that contain the

interval $[$u$,$ v$].$ Your explanation must clearly state how intervals are mapped to points and the

priority search tree operation to be used along with its parameters and complexity.

$($b$)$ Describe, using pseudocode, how to perform the operation minXinRectangle$($xL$,$ xR$,$ yT $)$ in a

radix priority search tree.