$ q_{0}\text{:is the initial state,responsible for pushing u into the stack}\\ q_{1}\text{:this state is for reading characters of w and pushing into the stack}\\ q_{2}\text{:it reads string and matches it with topmost character of the stack and if they match,it is popped.It deals with }w^{R}\\ q_{3}\text{:reads v and pops out u from the stack}\\q_{f}\text{:after popping out equal number of u's as v's from the stack,if any character of u is left or alternatively initial stack top symbol isn't exposed,it accepts it.}$.
