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 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.

the Answer should be Handwritten.No computer type, please. need only simulation.

/// You have to solve only 1 -A . I added a sample Question and Sample answer . please Solve like this. otherwise answer should be Excepted .

////////////// Sample Question and Answer ;

1. a) Consider the following graph: 6 Draw the DFS search tree, where a is the starling vertex; traversing the graph in alphabetical order. Show discoveryand finishing. lime at 'cch vertex. b) Describe the properties of dynamic programming algorithms. 1. Consider the following graph: Draw the DFS search tree, where A is the starting vertex, traversing the graph in alphabetical order. Show discovery and finishing time at each vertex