(a) Interpret the statement "If a problem A is NP-Complete, there exists a non-deterministic polynomial time algorithm to solve A". Discuss the non-deterministic polynomial time algorithm with an example. (b) "If problem Y can be reduced to problem X in polynomial time". Illustrate the above sentence with example. Explain the role of reduction