There are n ill-behaved children named 1, 2, · · · , n. You are given a bunch of statements of the form "i throws rocks at j". Your goal is to arrange the kids into rows such that if i throws rocks at j then i must be in a lower numbered row than j. Give an algorithm to find the minimum number of rows needed, if it is possible.

recordhoped i can i get brainliest

If you wan to knnow if this is true or false its true

That i would call a dead end, since you can't know that it's always possible to immediately reconnect (server could be down, lines between you and the server could be down), and even if it was this would take some time slipping the packages out your wan in the meantime.the solution to this problem rather like satras says to block wan access for those hosts, and if policy routing is being used you need to use the soltion found by fastlanejb in this thread:   the link to the problem forum