Consider L4 = { | G is a graph containing a route that visits each vertex exactly once}. L4 is not known to be in P. Show a high-level description of a TM that decides L4 in nondeterministic...

Consider L4 = { | G is a graph containing a route that visits each vertex exactly once}. L4 is not known to be in P.

Show a high-level description of a TM that decides L4 in nondeterministic polynomial time. Show your time complexity analysis of the TM.