Let L = {w ∈ {a, b}^∗| w has twice as many a′s as b′s}. Draw the state diagram of a P DA that accepts language L. Your P DA should not be overly complicated.