Ed sample Final-s16.pdf x C Chegg study l Guided solu K- O uwm.edu/ Final-S16.pdf classes/cs535/HW/Sample 5. (3 pts.) Let G (V, E) be a directed acyclic graph (i.e., a DAG) in which each node v E V has an associated price pa, that is a positive integer. Let cost v price of the cheapest node that v can reach, including v itself Our goal is to output cost v for each v e V in an efficient manner. (i) (Warm-up!) Given the graph below where the numbers indicate the prices of each node. Please compute the cost of each node i.e., what is cost A cost Bl? etc. 5 AM 5/8/2017