Hello, I need help solving this computer science question.

Describe in English a PDA accepting the language L as follows: L = {W1#w2#... #w#w: ww; {0,1}* and w;= wR for some j}. That is, for a string to be in L, it must have alphabet a subset of {0, 1, #}, and when cut up into pieces by omitting the #, the final piece is the reverse of one of the other pieces. Describe in English a PDA accepting the language L as follows: L = {W1#w2#... #w#w: ww; {0,1}* and w;= wR for some j}. That is, for a string to be in L, it must have alphabet a subset of {0, 1, #}, and when cut up into pieces by omitting the #, the final piece is the reverse of one of the other pieces