When trying to prove that Automata A accepts the language L, what are the steps of the proof,
should I explain that if w is accepted by L than it is also accepted by A?
Should I explain the opposite?
Or maybe show that if w is not accepted by L than it is not accepted by A?
all of the above?