Honorable Experts, ITS MY 5TH TIME POST, STILL I COULD NOT FIND A PROPER ANSWER, PLEASE SOLVE THIS ACCORDING TO MY ANSWER. I WOULD BE ALWAYS GRATEFUL TO YOU.

could you please solve this with 100% accuracy? you have to solve this with questions and instructions. please you have to show all your simulation work. Otherwise don't need to answer this.

Course - CSE 373 - Data Structure ( Theory Part ) Don't Need to Write unnecessary coding part.

YOU have to solve only -5 B

The answer should be Handwritten.No computer type, please.

###Give a simulation for each step, please. without simulation, I could not get full marks.

5. a) Define the following and show the relationslaip anong thein: (i) Polynomial time problems (ii) NP Hard Problems (iii) NP.Completeness. b) Find a longest strictly increasing subsequence (not necessarily contiguous) from the following sequence.