Need help with number 1.

You dont need to write pseudocode; English description of your algorithm will be fine.

warning! Due to in Announcements- Ch6 Architectural c D Ch5 System model D ch4 Req Eng.pdf O Hw6 cop4S31.pdf e Need Help With N C | www.cs.fsu.edu/~tvhoang/classes/Hw6-cop453 1.pdf Apps New Tab Online Derivative Ca M ITSDocs: Create, Cop In Unik, how do I list db vi/vim notesIn Unix, how do I cha C-String Password-Introduction to OOP Implementing Sieve Hw6_cop4531.pdf 1. [20 pointsl Let G be a directed acyclic graph (DAG), where each edge (u, v) has weight w(u, v). Let s be a node in G, and assume that G has n nodes and m edges. We now want to find the longest paths from s to every node in the graph. The Longest-Path problem can be solved by dynamic programming as follows. Without loss of generality, assume that the node s has no incoming edges, meaning no arrow pointing at s if you draw the graph G.1 a) First label the nodes of G by 0,1,... ,n -1 respectively such that for any edge (u, v), we must have label(u)