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.

>>5 Ya, I realize that at this point. My problem isn't finding the grammar, it's proving that because I am able to represent it as a grammar, that it then means that the language is deterministic. I know how to prove it's context-free.

Thanks for trying though.