1. Given the undirected graph
G = {{1,2},{2,3},{3,4},{4,9},{5,2},{6,2},{7,8},{8,5},{9,8}},
(1). Provide a graphical depiction (i.e. nodes and edges)
(2). Provide an adjacency matrix and adjacency list representation of the graph
(3). Show that G is cyclic or acyclic using the Union-Find algorithm. Provide
which edges were investigated, their order, and the parent array once you
determine if G is cyclic or acyclic.