Construct a PDA that accepts $\{$ x#y#z $|$ x$,$ y$,$ z in $\{0,1\}+$ with x $$ y$,$ or x $$ z$,$ or y $$ z $\}.$ Define x $$ y as follows: Let x $=$ x$1$x$2...$ xn and y $=$ y$1$y$2...$ ym$,$ and let n$\text{'}$ and m$\text{'}$ be the largest odd values less than or equal to n and m respectively. Let x$\text{'}=$ x$1$x$3...$ xn$\text{'}$ and y$\text{'}=$ y$1$y$3...$ ym$\text{'}.$ Then x $$ y if x$\text{'}$ y$\text{'}($that is$,$ x$1$x$3...$ xn$\text{'}$ y$1$y$3...$ ym$\text{'}).$ For your PDA to work correctly it will need to be non$-$deterministic. You can assume that you will always be given a valid string $$ that is$,$ the input will always contain two #s$,$ and x$,$ y$,$ and z will be strings over $\{0,1\}$ of length greater than $0.$

Make sure the PDA accepts x#y#z under any of the following conditions: $|$x$\text{'}||$y$\text{'}|$ or $|$x$\text{'}||$z$\text{'}|$ or $|$y$\text{'}||$z$\text{'}|$ or there exists odd value i with xi $$ yi or xi $$ zi or yi $$ zi$.$ Provide all of the transitions plus a screenshot of the JFLAP transition diagram