preferably using the notation: P = (Q, , ,, q0, F)

Give deterministic pushdown automata to accept the following languages: a) {0^n 1^m | n <= m}

b) {0^n 1^m | n>= m}

c) {0^n1^m0^n | n and m are arbitrary}