What path is returned by MysteryPath for the graph below? 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); s foreach EV do s end path = {}; 8 while countr!0 do o Add u to path; 10count|vl- o; 1 foreach u EN(v) do 121 if count[u]00 then end 14 15 end 16Let v be the neighbor of u with the smallest value of count; 17 end 18 Add v to path; 19 return path; : What is the worst-case time complexity of Mysteryl'ath when using an adjacency list to represent the graph and a direcr map to represent count? Justify your answer. You may assume that the algorithm will never visit the same vertex twice and that it takes 6(1) time to return the degree of the vertex