2. Write a TM R2 which accepts the set of binary strings which, when interpreted as positive decimal integers, are evenly divisible by 4 (note this means the input string ends in 100), and rejects all other binary strings. R2 should have a ={0,1}, and a ={0,1,B}. State the set of states Q you choose. Your TM can have either 3,4 , or 5 states. Write the full TM program of your TM and give a small example of how your TM works on two different inout strings, one which accepts the input and another string which rejects it