Formal Languages and Automata

Will somebody please help me with this problem? Yes, it is a homework problem, but I've been at it for days and am not making progress. Thanks /prog/

Prove L = {a^(n)b^(n) | n≥ 0} is a deterministic context-free language.

>>7

How does one do that? I know how to make pda's, but for this specific one, how do you build a deterministic one? At a certain point you will have two choices in a single state, whether to continue parsing a's, or to switch to parsing b's, making it non-deterministic.