can anyone do 35 , 36 ,37 ,38,39 ( if not all of them please do as much as you can) .. ASAP

35. (3 points) Assuming p is the start state and r is a final state, which of the following 5-tuples describes the FA in the transition table? D. None of these 36. (4 points) Assuming p is the start state and r is a final state, which of the following regex's represents the FA in the transition table? B. (alb)(c*a(ab))blc C. (c*(alc)lbc *(alc)*)*c*bl(c*(alc)bc*(alc)*)cD. None of these 37. (4 points) Given a set A containing n elements, what is [P(A)]? A. (2An)-1 C. (n*2)/2 B. (n 2)-1 D. None of these 38. (4 points) Which of the following describe the resulting set of ZxZ, where Z is the set of all integers? A. Countably Finite C. Countably Infinite B. Uncountably Finite D. None of these 39. (4 points) Which of the following regular expressions express a language in which every word has an even number ofb's and the alphabet is {a.b). Example: a, aa, abba, baab, bbbbbb A. (alb)*b*a* C. a*b*a*b*a* B. (a*ba*b)*a* D. None of these Memory Slot Programs M1 M2 M3 M4 2,3,8 3,5,8 5,6,7 3,6 1,3,4,6 40. (4 points) Your computer has multiple different programs running concurrently that all need to store data in one or more slots in memory. Using the above table and the maximal independent set algorithm, which of the following would be a possible scheduling of the programs? B. 2.4,5,7, 6,83,1,3) D. None of these C. 2.4,53.11.7.8).(3).6)