Most people when thinking of the P vs. NP thinks of it as unsolved or unsolvable although it goes with a simple algorithmic proof in which I have written in my previous paper. Now as you may know, the P vs. NP can lead to some of the greatest breakthroughs in computer science, and mathematical physics. The question however asks you to use a method to figure out the complexity vs. non-complexity of a problem, which I have demonstrated in my last paper as the example of someone removing 100 possible students from a group of 400 and then coming up with the different combinations in which the 300 can’t be picked. This problem can be used in example with probability and solved through the complex equation where there is a solution for P equaling NP and you would then get ((400!)-(100!*3)). I gave this example using set theory and logic as well. This number would then be more than the number of atoms in the known planet in which we live on. However this is just one of the examples. My next example was an example of how some computers show through algorithms and polynomials that P does equal NP.