Given n the number of gophers nh the number of 1-gopher holes, time the number of seconds before death v the speed of each gopher the x y coordinates of each gopher, and the x y coordinates of each hole.

Return the number of gophers that can be saved when the gopher community uses its optimum strategy.

[ if you make a graph and use a standard graph algorithm, be specific about how you are making the graph. You can just invoke a standard graph algorithm as part of your pseudocode you dont need to give details but you DO have to show what you are passing to it and what you are getting back. Your big O analysis should include both the stuff your pseudocode does directly and the work done by the standard graph algorithm.]

Example (n nh time v followed by n gopher locations, then nh hole locations) 2 2 5 10 1.0 2.0 100.0 100.0 20.0 20.0

1 gopher can be saved from the flock of eagles (but there is no way to save more than 1).