3. The decision problem HamPath is defined as follows: Problem Instance: an undirected graph G- (V,E). . Question: Is there a simple path P in G having exactly IVI-1 edges? The decision problem HamCycle is defined as follows: Question: Is there a simple cycle P in G having exactly IVI edges? Question: Is there a simple cycle P in G having exactly IVI edges? Give a complete proof that HamCycle Sp HamPath. Assuming that HamPath is NP-complete, prove that HamCycle is NP-complete