= Let M follows: (K, E, , A, s, A) be a PDA. The language accepted by M by final state is defined as Lf(M) = {w E **|(s, w, e) FM (f, , a) for some fe A, a T*} Note that to show two languages L and L2 are the same (e.g., as in the two parts below), it is generally simplest to show that Li C L2 and the reverse. (a) For every PDA M, show there is a PDA M's.t. L(M') = Lf(M). Notice that one uses the subscript f and the other does not. (b) For every PDA M, show there is a PDA M's.t. Lf(M') = L(M)