type Vertex $=$ Int

type Edge $=($Vertex$,$Vertex$)$

type Graph $=[$Edge$]$ graph$1$ :: Graph

graph$1=[(1,2),(2,2),(2,4),(4,3),(3,3),(5,6),(6,5)]$ Write a haskell function called numVE that takes as input a graph and returns a tuple that represents the

number of vertices and number of edges