In the Hole Drilling Problem (HDP), we are given a set of n 2D points, representing holes that need to be drilled, and we need to produce a permutation of points c[1], c[2]. ..., c[n] such that traveling from point c[1] to c[2] ... to c[n] has the shortest possible distance, which represents the path we would take to drill those holes as efficiently as possible. Distance here refers to Euclidean distance ((b.x-a.x) + (b.y a.y)). 1. How would a greedy algorithm choose the best starting point for HDP? Briefly justify your answer. 2. Once you have a starting point, how would you choose which point to visit next? Briefly justify your answer. 3. Give pseudocode for a greedy algorithm to solve HDP.