computer networks fifth by edition Tanenbaum 1. Given a clock with transition sequence 0,1 per cycle “ i. e. 010101 constituting 3 cycles, develop the Manchester encoding for the following message: œThe big one (11 characters). Use the ASCII code. Then show the recovery of the original message. 2. Given the CDMA example in Tannenbaum’s text, Chapter 2, show the encoding and decoding of : _ _ A + B + C + D. E-BOOK