Q$3.$ Suppose that two arrays of $N$ integer values, A and $B,$ are in sorted order. Implement a Java

method $($pseudocode$)$ that will find the median value of $AB$ in $O(logN)$ time; your solution

should conform to the interface:

int unionMedian$($int$[]$ A$,$ int$[]$ B$)$;

Q$4,$ Consider applying radix sort to a list of $10,000$ integers in the range from $1,000,000$ to

$9,999,999$

i$.$ Not counting the space needed to store the integers themselves, how many bytes of

memory would be required? Assume pointers$/$references occupy $4$ bytes. Note: radix

sort ALWAYS uses a linked structure to store the elements in a bin.

ii$.$ How many times would radix sort examine each value in the list?