Explain the differences between P and NP algorithms in terms solution and verification. Give one example of a known algorithm that you have seen in the lab of this course of each type with its complexity. P : fibo iterative NP: nn queens Also discuss what is the implication if somebody proved that P=NP in terms of password securities