In a graph $($ u $,$ v $),$an edge $($ u $,$v $)$is good if all other vertices of G are adjacent to both u and v $,$i $.$ e $.,$all other vertices are connected to both u and v via different edges. Assume that G is a clique of size n $($ i $.$ e $.,$a complete graph of n vertices $),$what is the least number of edges to be removed so that G does not have any good edges left after the removal. Is this problem in NP