Answer the following questions about the MysteryPath algorithm below, which take in a graph and returns a path. Input: G- (V, E): graph with n vertices and m edges Input: m, n: size and order of G, respectively 1 Algorithm: MysteryPath 2 count-Map(V Z); 3 foreachvEV do count[u] = deg(u); s end 6 path= {}; V1]: 8 while count[u] 0 do Add to path; 10 1foreach u E N(v) do if count(u-x then count count u- 16 Let be the neighbor of u with the smallest value of count; 17 en 1s Add v to path; 19 return path