Theory of Computation Push Down Automata question

Push down automata Provide informal descriptions and state diagrams of pushdown automata for the languages below, on the alphabet sigma = {a, b}: a. {w | w=a^i b^j where i > j > 0 } b.{w | w contains an even number of b's} c. {w | w=a^k bbba^k where k greaterthanorequalto 0} d. {w | w=b^k ab%k a^j b^j where j,k greaterthanorequalto 0}