3 (This question is not in the textbook) Give state diagrams of either finite state machines that recognize the following languages or Turing machines that decide the following languages over the alphabet (o, 1). Note that you have to see whether the language is recognized by a finite state machine. If it is, give the state diagram of the finite state machine. Otherwise, give the state diagram of the Turing machine (assume that the set of tape alphabets= {0, 1,uM). a. {0' i > 0 and J > 0)(10 points) b. (o"1" I n >0. (10 points)