solve it 1. A group of \( N \) stations share a \( 56-\mathrm{kbps} \) pure ALOHA channel. Each station outputs a 1000-bit frame on average once every 100 sec , even if the previous one has not yet been sent (e.g., the stations can buffer outgoing frames). What is the maximum value of \( N \) ? Notes: Throughput Pure ALOHA is 0.184 and for slotted ALOHA 32\% 2. Give two reasons why networks might use an error-correcting code instead of error detection and retransmission. 3. Six stations, \( A \) through \( F \), communicate using the MACA protocol. Is it possible for two transmissions to take place simultaneously? Explain your answer. 4. Give two example computer applications for which connection-oriented service is appropriate. Now give two examples for which connectionless service is best. 5. If costs are recorded as 8-bit numbers in a 50-router network, and distance vectors are exchanged twice a second, how much bandwidth per (fullduplex) line is chewed up by the distributed routing algorithm? Assume that each router has three lines to other routers.