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 instructions. please you have to show all your work. If any need, You have to draw a diagram and Graphical Simulation for each step then you can solve this problem .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 B Number ; Answer should be Handwritten.No computer type please .

b) Find a longest strictly increasing subsequenee (not necessarily contiguous) trom the following sequence.