Question 6 Question [4 points] Not yet answered Marked out of 4.00 For the finite state machine given below P Flag question 0,1 a regular expression for the set recognized by the machine is the following: Select one: 0 0 000 None of these O 00 00 en 7 Question [4 points] ed out of For the finite state machine given below, which of the input string is recognized b the machine. 5 n 0.1 Select one: o None of these 10010 0010 010101 01011 Question 8 Question [4 points] Not yet answered Which binary relation p on the set S = {0,1,2) is an equivalence relation? Marked out of 4.00 P Flag question Select one: p=f(0,0), (1, 1), (2.2), (0, 1). (0,2), (1,2).(1.0), (2.0), (2, 1)} O None of the others p ={(0,0), (1, 1), (2, 2), (0, 1), (1.2). (1,0). (2,1)) p = (0,0), (1, 1), (0, 1), (1, 0)) p = f(0,0), (1, 1), (2, 2), (0, 1), (1, 2)} Question [4 points] on 9 E red dout of There are 7 yellow, 6 green and 5 black balls in a bag. All the 18 balls are drawn one by one and arranged in a row. In how may ways can this be done? 3 on Select one: 19! 11!518! O 18!6!5!7! O 6!5!7! O 18! 615!7! O None of the others