3 Consider Dag G V E Special Node S V Let N U Number Distinct Paths S U Note Paths Need Di Q37095685

Advance Algorithm Analysisplease show all your work for my understanding.thanks
3. Consider a DAG G (V, E) and a special node s in V. Let N(u) be the number of distinct paths from s to u. Note that the paths need to be distinct and not disjoint. Write a recurrence for N(u). Write a dynamic program based on this recurrence, using a topological order of the nodes as the

OR

 

OR