NP is the class of problems for which given solutions can be verified in polynomial time. With this definition, it is easy to perceive why P is a subset of NP.
Thank for your appreciation. If it helps you can also watch QnA session with Prof. Garg ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-hhEx2zNFPAk.html
Greetings Professor .. I am an Iraqi PhD student I study in Malaysia and I need your help because I work with the same competence I can communicate with you ... with appreciation
Thank you for your comment. You can also watch QnA session with Dr Garg ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-LgYPnYHJ-pk.html and more on www.livingscience.in