i need the answer of this Automata and Computability course question.

Q3.1 PDA Design 8.0 points possible (graded results hidden) Consider the skeleton of a PDA (Diagram 3.1) for the language Lover the alphabet (a, b, c, d). - (a, b, c, d), L-(aPbc'd I p. 4, 5, 5 >O AND P+q-rus) In the PDA skeleton qo is the start state, q4 is the final state and (20) is the stack symbol. Complete the PDA by adding necessary transitions and answer the following questions. qo q1 92 q3 94 Fig. 3.1 1. What should be the result of the transition function 8 (90, a, a)? 2. What should be the result of the transition function 8 (90, b, 20)? 3. What should be the result of the transition function 8 (q1, b, a)? 4. What should be the result of the transition function 8 (q1, b, b)? 5. What should be the result of the transition function 8 (91,c, b)