Say that you are given a pattern, expressed as a regular expression, and told to write a function which is passed a string and returns true if the string is a member of the language described by the regular expression and false otherwise.

a. Describe how you could use your knowledge of deterministic finite automaton in order to implement this function.

b. Write pseudo code for the function.