A network of n computers is such that we have m pairs of computers connected using full duplex wired links: a full duplex link is a direct two-way wired connection between two computers. The wired connectivity of a computer is the number of computers it can talk to via any sequence of wired links. What is the efficient time complexity to find a largest subset of existing wired links that could be removed without changing any computer’s wired connectivity.

I wasn’t able to think how to solve this question.HELP.