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.

>>2

I understand that making a grammar would prove that it's context-free, but that doesn't necessarily prove that it's deterministic does it? Is it even deterministic?