part a The mathematical behavior of complexity was demonstrated from module 1 using Big O Notation. Using these notations , explain the differences between Polynomial (P) , and Non deterministic...

part aThe  mathematical  behavior  of  complexity  was  demonstrated  from  module  1  using  Big  O  Notation.   Using  these  notations  ,  explain  the  differences   between  Polynomial (P) ,  and  Non deterministic  Polynomial (NP) equations.   In  the  case  of  NP  you  can  have   the  situation  where  the  algorithm  behaves  NP-Hard  or  NP-Complete, in  each  situation  differentiate  these  characteristics.

part bProvide  real  world  examples  that  differentiate  the  characteristics  of  P, and  NP  arguments and show if  P=NP.

solve its part b