3) Examine the following Weighted Graph and tell if it has a Hamilton Circuit or not. If so, use the Nearest Neighbor Algorithm at each Vertex to find an (approximate) Minimum Hamilton Circuit. If we wanted to use Brute Force on the Graph, how many Hamilton Circuits would we need to check? E 7 D 2 5 6 8 6 3 1 A C 4 7 B