QUESTION 7 The languaged of matched parentheses is not regular. Thus the Kleene theorem says Since Python requires matched parentheses, Python is regular. There exists a finite state automaton that recognises the language of matched paretheses A regular expression is required to recognise the language of matched paretheses. O There is no finite state automaton which recognises the language of matched parentheses