This is about Turning Machine, Please show correct answer and steps.

1. (10pts) Design single-tape Turing machines that accept the following languages using JFLAP a) L,-{ w : na(w) = nb(w) : we {a, b)' }. Result accept accept aaaaaabbbbbb accept accept reject reject reject Test case abbaba ba abb bbaab b) L3 = {ww : we {a, b)' }. Test case Result abaaba bbbbbbaccept accept aabbaabb| accept reject reject reject aabb