deletions | additions       diff --git a/q3.tex b/q3.tex  index c01fd45..fe31725 100644  --- a/q3.tex  +++ b/q3.tex 
...
At each step we have to do k comparisons to find the smallest number and we are basically doing binary search to each array the running time is   $k*(time of binary searches)$  Runtime= $\theta\k\sum_{i=1}^{k}\logm_i$ $\thetak\sum_{i=1}^{k}logm_i$  \end{enumerate}