turning machine please answer ONLY b) and c)

please give b) in the same format as the diagram shown

4. This question is about Turing machines and Computability. [overall 12 marks] (a) Consider the following Turing machine with input alphabet {a, b} and tape alphabet {a, b, u}: b/b/R a/a/L U/U/R a/b/L a/b/L b/a/L 3 b/a/R U/U/R U/U/R accept reject Give computations for the words b and bb. State for each word whether the machine accepts it, rejects it or loops. If the machine loops, then give the first five configurations of the computation. [6 marks] (b) Draw a Turing machine that decides the language of all words over the alphabet (a, b) that contain at least one a and one b. For example, ab and abba are in the language, but aaa is not. [3 marks] (c) Prove that the decidable languages are closed under intersection. [3 marks]