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 s end 6 path= {}; V1]: s while count[v) 0 do 1 count[v-o; 1foreach u E N(v) do if count(u-x then countu count u] 1: 16 Let be the neighbor of u with the smallest value of count; 17 end 1s Add to path; 19 return path