Which of the following finite automata recognizes L ? Which of the following languages is described by this regular expression? (bab)aa(bba) L={w{a,b}w contains substring aa at least once } L={w{a,b}w contains substring aa followed by b } L={w{a,b}w contains substring aa preceded and followed by b} L={w{a,b}w contains substring aa exactly once }