4. There is a network that consists of n computers, with some computers having access to other computers. Owner of one of the computers is a hacker. He created a virus, which every day at midnight copies itself to one of the accessible computers, that have not been infected yet. How to find, after how 5. many days all computers will be infected? Propose an algorithm to solve this problem. What is its running time? minimal spanning trees we estimated that the worst-case running time of Kruskal algorithm is O(mlog(n)). Is it possible to implement it with a better running time? If yes, give a reference 4. There is a network that consists of n computers, with some computers having access to other computers. Owner of one of the computers is a hacker. He created a virus, which every day at midnight copies itself to one of the accessible computers, that have not been infected yet. How to find, after how 5. many days all computers will be infected? Propose an algorithm to solve this problem. What is its running time? minimal spanning trees we estimated that the worst-case running time of Kruskal algorithm is O(mlog(n)). Is it possible to implement it with a better running time? If yes, give a reference 4. There is a network that consists of n computers, with some computers having access to other computers. Owner of one of the computers is a hacker. He created a virus, which every day at midnight copies itself to one of the accessible computers, that have not been infected yet. How to find, after how 5. many days all computers will be infected? Propose an algorithm to solve this problem. What is its running time? minimal spanning trees we estimated that the worst-case running time of Kruskal algorithm is O(mlog(n)). Is it possible to implement it with a better running time? If yes, give a reference