Write an algorithm that gets $k$ arrays $A_0,A_1,dots{A}_{k-1}$ as input, each of size $n.$ The algorithm

should return the arithmetic mean of the set $\{m_0,m_1,dots{m}_{k-1}\}$ where $m_i$ is the median of

array $A_i.$

Write your algorithm in clear pseudocode. $($Do not submit Java$/$C code.$)$ Derive the run time

of your algorithm. Express the runtime as a function of both $k$ and $n.$ Give the worst$-$case

big$-$O runtime of the function.