Suppose we have an array A $=[$a$,$ b$,$ c$,...,$ y$]$ of $25$ integers. When implementing FastSelect $($a$.$k$.$a$.$ the median of medians$)$ we form the following $5$ subarrays, each of which is sorted:

$[$d$,$c$,$b$,$e$,$a$]\backslash \backslash$

$[$i$,$f$,$h$,$j$,$g$]\backslash \backslash$

$[$l$,$m$,$k$,$n$,$o$]\backslash \backslash$

$[$p$,$s$,$q$,$r$,$t$]\backslash \backslash$

$[$w$,$x$,$v$,$u$,$y$]$ We take the medians from the $5$ subarrays $($i$.$e$.$ b$,$ h$,$ k$,$ q$,$ and v$),$ and we collect them into a new sorted array $[$k$,$ h$,$ q$,$ b$,$ v$].$ Which element is the median of A$?$ Enter a single lower letter case. How many elements you can guarantee are less than or equal to h$?$ enter a single numerical value. How many elements you can guarantee are greater than or equal to h$?$ Enter a single numerical value. True or False: h is a good pivot.