Which of the following is a way of proving a language L is a DCFL$?$

$$ Find a regular expression that describes it$.$

$$ Find a grammar in CNF that generates it$.$

$$ Find a CG that generates it$.$

$$ None of the available answers will work.

$$ Find a PDA that accepts it$.$