a$.$ Turing Machines $($TM$)$ can recognize many languages by exhaustively searching over all possible options until a solution is found. There are many applications of TM one among them is the manipulate of string handling.

On the above context, draw a Turing machine diagram that transforms a string containing only p$$s$,$ q$$s$,$ and r$$s of length $4$ and replace each letter preceding $$p to q$.$ Elaborately explaining the algorithm and states of the Turing machine.

$[$Example: consider a string qrrq would remain unchanged because there is no p$$s available and, in the string, while rprrpp would change to qprqqp$.][$Note: Please follow the naming conventions explained during the module delivery. Eg if the student name is BADER ABDULLAH NASSER AL HARRASI, then replace p$=$B$,$q$=$A$,$r$=$N$]$

b$.$ Give an algorithm for the Turing machines that decide the following languages over the alphabet $\{$p$,$q$,$r$\}.$

c$.\{$w$|$ w contains more than $5$ times as many q$$s as p$$s$\}$

i want answer for question B and C and

note the answer related to question A