Ethan Hunt is tasked with sabotaging a computer network. Given below is the communication graph of the

network, $2$ computers can transmit information to one another if there's an edge between them. Since the mission

is time$-$sensitive$,$ he would like to be efficient and achieve the task by sabotaging the fewest number of computers to

disconnect the network. Find that number and the specific computers to sabotage.