Question 3 a) Construct a simplest possible PDA using state transition diagram that accepts the language Lover alphabets {0, 1} that precisely contains those strings where, the first and the last letter or symbol in the string are the same. b) Demonstrate by computation that 01010 L(M) and 10110 L(M) to validate the PDA that you have constructed