Assignment #2 1. In the MLT-3, there are three transition rules , and three levels (-V,0, and +V). Those rules are: 1. If the next bit is 0, there is no transition . 2. If the next bit is 1 and the current level is not 0, the next level is 0. 3. If the next bit is 1 and the current level is 0, the next level is the opposite of the last nonzero level. Your task is to write a set of programming codes that simulate the MLT-3 scheme with the given sequence shown in the figure below (the second one (b.)). The first one (a.) is for the lustrative purpose (refer to the Lecture 04, pages 39 through 42). The second one (b.) is for your task. The third one (c.) is for the rules to be specified. 0 1 1 1 0 1 1 1 1 0 1 1 1 1 1 IIIIIIII +V Next bit: 0 Next bit: 1 Next bit: 1 OV II Time Next bit: 1 a. Typical case Last Last non-zero non-zero Next bit: 0 level: +V level: V Next bit: 0 C. Transition states 1 1 0 1 0 1 1 1 0 1 1 0 1 1 1 II III +V II III IIIIIIII OV IIIIIIII IIIIIIII Time