5. Given a computer network with n computers and m connections between them. On some computers a spy program could be installed, that intercepts all data sent to/from that computers. You need to find the smallest set of computers that should be infected by a spy program so that all data sent within the network will be intercepted. Represent this problem as an algorithmic problem. What is this algorithmic problem? Is it possible to solve it in a polynomial time