2. Given M (1,2,3,4), ta.b3, 8, 1, (4)), where 8 is defined as follows. (a) Give a computation tree for string abaa and decide whether M accepts the string. (b) Use the subset construction algorithm to find the equivalent DFSA. M ab 1 2,34 4