Algorithm: Please show work. Thank you!

Recall that a graph G = (V, E) is defined by a set of vertices V and set of edges E. An edge e E E is incident to vertex E V when u is one of e's endpoint vertices. isolated verter input: a graph G with n vertices and m edges output: True if G contains a vertex with no incident edges, or False otherwise The two most common data structures for graphs are the adjacency lists and adjacency matriz. You can choose whether the input to your algorithm is in adjacency lists or adjacency matrix format. Hint: A decent algorithm for this problem runs in O(n2) time, and an optimal one takes O(n) time