create java algorithm code which takes any input map filename as a command line parameter, starting at any given source point, visits each building by touching at least one hull point of each building but without passing through any building, finally arrive at the given destination point. Test the code and output the test map, with the path finding solution clearly shown. Show both the map polygon and the hulls. Give the runtime and path length for the solution.

sample map: blue is the source point, pink is the destination point

\f