An Erdos-Renyi random graph G(n,p) is generated by two parameters

n: the number of vertices.

p: a number in [0,1], which is the probability that each of the n(n-1)/2 edges is independently included in the graph.

Generating a random graph. Write a function to generate a random graph given n and p.

Input: an integer n>1 and real number p in [0,1]

Output: an undirected graph G. You can use whatever format to store the graph (e.g., adjacency list or matrix).

Hint: Initiate G to be an empty graph (no edges). For each i