Question 4: Do as Directed (28 Points) (2 Point) Provide C Structure to store structure given left: - 3 4 1 2 N -12 -11 -10 5 6 7 8 -8 -9 -7 9 10 11 12 -4 -6 -5 13 14 15 16 1 | -3 -2 17 18 19 20 3 (2 Points) Provide In Degree/Out Degree 6 +++++ In Degree Out Degree V-1 V-2 3 V-3 V.4 V-5 11 V-6 V-7 (3 Points) Provide iterative code to calculate In-Degree if weighted graph is stored in G[N][N]