2. Given a complete (a complete graph is a graph such that every pair of vertices has an edge), undirected weighted graph G( VE), and a pair of distinct vertices vu from V, we would like to find the maximum weight simple path with length | - 1 from v to u. (A path is called simple if it never passes the same vertex twice.) Here we assume that all weights are positive. Your Task: Try to find the maximum weight path with length 4 from vertex a to e in the following graph using exhaustive search. You should list all possible simple paths with length 4 from a to e and find the one with maximum total weight. a 19 2 e 8 15 19 6 14 23 21 12 d 26 Hint: a maximum weight simple path from v to u with length 4 must pass through all other vertices in V