Consider the following propositional logic formula that clearly corresponds with the transltion relation:

(p <-> b | a & xp) & (q <-> p & xp)

You can compute the following BDD for this formula:

It is not that I would suggest to solve the exercise this way, but the BDD above shows all the satisfying assignments, and these correspond with the transitions of the automaton.