can you provide a thought process and approach $($which algorithm$)$ you used for for this: In a complete graph of n vertices, each vertex is connected to every other vertex. Therefore, each edge $($ u $,$v $)$is a good edge as all other vertices are adjacent to both u and v $.$The total number of edges in a complete graph of n vertices is given by the formula n $($ n $-1)/2.$Therefore$,$ to ensure that there are no good edges left, we would need to remove all the edges. So $,$the least number of edges to be removed is n $($ n $-1)/2.$ The problem of determining whether a given graph has a good edge can be solved in polynomial time. We can simply check for each edge $($ u $,$v $)$whether all other vertices are adjacent to both u and v $.$This can be done in O $($ n $^3)$time$,$ where n is the number of vertices in the graph. Therefore, this problem is in NP