Design a finite automaton (DFA or NFA) that recognizes the language L : L={ all strings starts with a and ends with b}{ all strings starts with c and ends with d} - Examples: The empty string does not belong to L. The strings adcb, cabd, aabb, cddad belong to L. The strings a, b, c, d, ac, db do not belong to L. Your answer must mention the 5 components of an automaton (,Q,,q0,F), in addition to the automaton figure