Create a hypergraph from its vertices and edges.
Print its vertices and edges.
Draw a graphical representation of this hypergraph.
Construct a new hypergraph from H by adding a new vertex, namely 8.
Print the vertices and edges of K.
Draw a graphical representation of K.
Check whether {1,2,8} is a hyperedge of H.
Construct a new hypergraph from H by adding {1,2,4} as an hyperedge.
Print the vertices and edges of L.
Draw a graphical representation of L.