we learned closest pair algorithm that runs in O(n log n) time. However, that algorithm can be improved further when additional assumption is made. Here is one. Suppose that there ar n2 bugs sitting on a piece of paper of size n by n. Any two bugs must stay away by at least 1 Each bug is given as a pair of coordinates. Design a linear-time algorithm that finds the closest pair of bugs. (Hint: since the input size is n2, the linear time here really means the running time is O(n2) where the n2 is the number of bugs.)