Answer : B
''maximum number of edges in a n-node undirected graph without self loops''
it means you have to make a complete graph , in complete graph there are edge between each node . you can't make two edge between between 2 edges , because in undirected graph it does't make sense.
so, no. of edges in complete graph = nC2 = n(n-1)/2