we can show the computation of the PDA on a given input using the IDs and next move relations. For example, following are the computation on two input strings.
Let the input be aabb. we start with the start configuration and proceed to the subsequent IDs using the transition function defined
( using transition 1 )
( using transition 2 )
( using transition 3 )
( using transition 4 )
( using transition 5 )
is final state. Hence ,accept. So the string aabb is rightly accepted by M.