You are given a graph G where G $=($V$,$E$)$ and a tree T derived from it where T $=($V$,$E$)$ with

E $$ E$.$ The vertices of G are V$,$ and the edges of G are E that have the form $($u$,$ v$)$ where u$,$ v in V$.$ Entries

are unique in V and E$,$ meaning that there are no duplicates.

Write a spanning tree verifier algorithm that takes in V$,$E from T and returns True if T is a spanning tree of G$,$

False otherwise.