Section 1: Directed Graphs 1. Let G (V,E) be a directed graph, where V a,b,c,d] and E-a,b, a,d,,.Determine if G is a DAG 2. Let G-(V,E) be a directed graph, where V a,b,c,d,e,f and E- [b,a, b,c, c,a, c,d, d,e, e,c), f,a , (f,e) .Determine if G is a DAG Section 2: Dynamic Programming ole e pelyinm knapsack capacity 8 object weightprofit 4 3 4 2 3 4 6