The number of possible undirected graphs which may have self loops but no multiple edges and have n vertices is ________
a. 2((n*(n-1))/2)
b. 2((n*(n 1))/2)
c, 2((n-1)*(n-1))/2)
d. 2((n*n)/2)