will upvote if answer is correct

(20 pts) Consider the graph below where we have a number on each edge. 3 D 4 3 B 1. (5 pts) Note the graph above does not fit the graph definition we have officially defined in class so far. You have to expand that definition by including a function represent the labels on the edges. Ic., the graph above should be represented by a triple(V, E, F) where F is the function on labels on the edges. Write below precisely, using notations of sets and functions, the content of V, E, and F 2. (5 pts) (Data structure) Design an array to represent the weighted graph. 3. (10 pts) Draw a tree to show the tracing of the depth first search algorithm for solving the A-D connectivity problem where A and D are nodes in the graph. DO NOT write your answer in the space below, but write it on your physical paper (or the device you use to manually compose your answer)