$1.$ Create an NPDA that accepts a language with an even number of characters with $|$w$|2.$ Any string in L must end with an $$a$.$ The machine must reject any string not in L$.$ If the string is accepted empty the tape except for a single $1$ on the tape, if rejected empty the tape with a single $0$ on the tape. The read head begins on the first character of w$.$

Let $=\{$a$,$ b$,$ c$\}.$

Let G $=\{$a$,$ b$,$ c$,1,0,,$ any additional desired symbols$\}.$

assume there is a z at the top of the stack$)$

You are to provide the transition diagram for your machine.