1. Write a program to find the longest simple path from x to y in a given weighted graph.
2. Could there be an algorithm which solves an NP-complete problem in an average time of N log N , if P ¢ NP? Explain your answer.
3. Give a nondeterministic polynomial-time algorithm for solving the partition problem.