(Solved):
Example packets \( =[1,2,3,4,5] \) channels \( =2 \) At least one packet has to go through each ...
Example packets \( =[1,2,3,4,5] \) channels \( =2 \) At least one packet has to go through each of the 2 channels. One maximal solution is to transfer packets \( \{1,2,3,4\} \) through channel 1 and packet \( \{5\} \) through channel 2 . Channel 1 Test Results Custom Input