1. Given a NFSA M=({1,2,3,4}, {a,b}, 8, 1, {2,4}), where 8 is defined as follows: (a) Give a computation tree for string aaba and decide whether M accepts the string. (b) Use the subset construction algorithm to find the equivalent DFSA. 1.2 3 3,4