Adjust the code below so that the transitions work as follows:

Transactions must follow the pattern below, e$.$g$.$

$($current state, symbol read$)->($new state, action$)$

the action can be write$/$read$,$ move right or left

transicao $=\{$

$(\text{'}$q$0\text{'},\text{'}$a$\text{'})$: $(\text{'}$q$1\text{'},\text{'}$b$\text{'}),$

$(\text{'}$q$0\text{'},\text{'}$b$\text{'})$: $(\text{'}$q$1\text{'},\text{'}$a$\text{'}),$

$(\text{'}$q$0\text{'},\text{'}\_\text{'})$: $(\text{'}$h$\text{'},\text{'}\_\text{'}),$

$(\text{'}$q$0\text{'},\text{'}>\text{'})$: $(\text{'}$q$0\text{'},\text{'}$R$\text{'},),$

$(\text{'}$q$1\text{'},\text{'}$a$\text{'})$: $(\text{'}$q$0\text{'},\text{'}$R$\text{'}),$

$(\text{'}$q$1\text{'},\text{'}$b$\text{'})$: $(\text{'}$q$0\text{'},\text{'}$R$\text{'}),$

$(\text{'}$q$1\text{'},\text{'}\_\text{'})$: $(\text{'}$q$0\text{'},\text{'}$R$\text{'}),$

$(\text{'}$q$1\text{'},\text{'}>\text{'})$: $(\text{'}$q$1\text{'},\text{'}$R$\text{'})$

$\}$

Here is the code to fix:

class MaquinaTuring:

def $\_\_$init$\_\_($self$,$ states, alphabet, tape$\_$alphabet, initial$\_$state, blank$\_$symbol, final$\_$states, transitions, start$\_$marker$)$:

self.states $=$ states

self.alphabet $=$ alphabet

self.tape$\_$alphabet $=$ tape$\_$alphabet

self.initial$\_$state $=$ initial$\_$state

self.blank$\_$symbol $=$ blank$\_$symbol

self.final$\_$states $=$ final$\_$states

self.transitions $=$ transitions

self.start$\_$marker $=$ start$\_$marker

self.configurations $=[]$

def run$($self$,$ input$\_$string, max$\_$transitions$=100)$:

self.initial$\_$configuration $=($self$.$initial$\_$state, self.start$\_$marker $+$ 'aabbba' $+$ self.blank$\_$symbol, $1)$

self.configurations.append$($self$.$initial$\_$configuration$)$

tape $=[$self$.$start$\_$marker$]+$ list$($input$\_$string$)+[$self$.$blank$\_$symbol$]$

head $=1$

state $=$ self.initial$\_$state

transitions$\_$count $=0$

while state not in self.final$\_$states:

if transitions$\_$count $>=$ max$\_$transitions:

choice $=$ input$("$Continue processing? $($yes$/$no$)$: $")$

if choice.lower$()!=$ 'yes':

break

symbol$\_$under$\_$head $=$ tape$[$head$]$

if $($state$,$ symbol$\_$under$\_$head$)$ not in self.transitions:

print$("$Error: No transition defined for current state and symbol."$)$

return

new$\_$state, new$\_$symbol, move $=$ self.transitions$[($state$,$ symbol$\_$under$\_$head$)]$

tape$[$head$]=$ new$\_$symbol

if move $==\text{'}$R$\text{'}$:

head $+=1$

elif move $==\text{'}$L$\text{'}$:

head $-=1$

elif move $==\text{'}$S$\text{'}$ and symbol$\_$under$\_$head $==$ self.start$\_$marker:

head $+=1$ # Se ler o marcador de in$$cio$,$ move para a direita

state $=$ new$\_$state

transitions$\_$count $+=1$

# Armazenar a configura$$o atual na lista

self.configurations.append$(($state$,\text{'}\text{'}.$join$($tape$),$ head$))$

# Perguntar ao usu$$rio se ele deseja ver todas as configura$$es

show$\_$configurations $=$ input$("$Deseja visualizar todas as configura$$es presentes na computa$$o$,$ desde o estado inicial at$$ a configura$$o final? $($sim$/$n$$o$)$: $")$

if show$\_$configurations.lower$()==$ 'sim':

for i$,$ config in enumerate$($self$.$configurations$)$:

print$($f$"$Configura$$o $\{$i$\}$:$")$

print$($f$"$Estado: $\{$config$[0]\}")$

print$($f$"$Fita: $\{$config$[1]\}")$

print$($f$"$Cabe$$a de leitura$/$escrita na posi$$o: $\{$config$[2]\}")$

print$("---")$

return state, $\text{'}\text{'}.$join$($tape$)$

# Exemplo de uso:

$\text{'}\text{'}\text{'}$

estados $=\{\text{'}$q$0\text{'},\text{'}$q$1\text{'},\text{'}$q$2\text{'}\}$

alfabeto $=\{\text{'}0\text{'},\text{'}1\text{'}\}$

alfabeto$\_$fita $=\{\text{'}0\text{'},\text{'}1\text{'},\text{'}$X$\text{'},\text{'}$Y$\text{'},\text{'}\_\text{'},\text{'}>\text{'}\}$

estado$\_$inicial $=\text{'}$q$0\text{'}$

espaco$\_$branco $=\text{'}\_\text{'}$

estado$\_$final $=\{\text{'}$q$2\text{'}\}$

transicao $=\{$

$(\text{'}$q$0\text{'},\text{'}0\text{'})$: $(\text{'}$q$1\text{'},\text{'}$X$\text{'},\text{'}$R$\text{'}),$

$(\text{'}$q$0\text{'},\text{'}1\text{'})$: $(\text{'}$q$0\text{'},\text{'}1\text{'},\text{'}$R$\text{'}),$

$(\text{'}$q$0\text{'},\text{'}\_\text{'})$: $(\text{'}$q$2\text{'},\text{'}\_\text{'},\text{'}$S$\text{'}),$

$(\text{'}$q$0\text{'},\text{'}>\text{'})$: $(\text{'}$q$0\text{'},\text{'}>\text{'},\text{'}$R$\text{'}),$

$(\text{'}$q$1\text{'},\text{'}0\text{'})$: $(\text{'}$q$1\text{'},\text{'}0\text{'},\text{'}$R$\text{'}),$

$(\text{'}$q$1\text{'},\text{'}1\text{'})$: $(\text{'}$q$1\text{'},\text{'}1\text{'},\text{'}$R$\text{'}),$

$(\text{'}$q$1\text{'},\text{'}\_\text{'})$: $(\text{'}$q$2\text{'},\text{'}\_\text{'},\text{'}$S$\text{'})$

$\}$

$\text{'}\text{'}\text{'}$

estados $=\{\text{'}$q$0\text{'},\text{'}$q$1\text{'}\}$

alfabeto $=\{\text{'}$a$\text{'},\text{'}$b$\text{'}\}$

alfabeto$\_$fita $=\{\text{'}$a$\text{'},\text{'}$b$\text{'},\text{'}\_\text{'},\text{'}$h$\text{'}\}$

estado$\_$inicial $=\text{'}$q$0\text{'}$

espaco$\_$branco $=\text{'}\_\text{'}$

estado$\_$final $=\{\text{'}$h$\text{'}\}$

transicao $=\{$

$(\text{'}$q$0\text{'},\text{'}$a$\text{'})$: $(\text{'}$q$1\text{'},\text{'}$b$\text{'},\text{'}$S$\text{'}),$

$(\text{'}$q$0\text{'},\text{'}$b$\text{'})$: $(\text{'}$q$1\text{'},\text{'}$a$\text{'},\text{'}$S$\text{'}),$

$(\text{'}$q$0\text{'},\text{'}\_\text{'})$: $(\text{'}$h$\text{'},\text{'}\_\text{'},\text{'}$S$\text{'}),$

$(\text{'}$q$0\text{'},\text{'}>\text{'})$: $(\text{'}$q$0\text{'},\text{'}>\text{'},\text{'}$R$\text{'}),$

$(\text{'}$q$1\text{'},\text{'}$a$\text{'})$: $(\text{'}$q$0\text{'},\text{'}$a$\text{'},\text{'}$R$\text{'}),$

$(\text{'}$q$1\text{'},\text{'}$b$\text{'})$: $(\text{'}$q$0\text{'},\text{'}$b$\text{'},\text{'}$R$\text{'}),$

$(\text{'}$q$1\text{'},\text{'}\_\text{'})$: $(\text{'}$q$0\text{'},\text{'}\_\text{'},\text{'}$R$\text{'}),$

$(\text{'}$q$1\text{'},\text{'}>\text{'})$: $(\text{'}$q$1\text{'},\text{'}>\text{'},\text{'}$R$\text{'})$

$\}$

tm $=$ TuringMachine$($estados$,$ alfabeto, alfabeto$\_$fita, estado$\_$inicial, espaco$\_$branco, estado$\_$final, transicao, $\text{'}>\text{'})$

#estado$\_$final, fita$\_$final $=$ tm$.$run$(\text{'}11011011\text{'})$

estado$\_$final, fita$\_$final $=$ tm$.$run$(\text{'}$aabbba$\text{'})$

print$("$Estado final:", estado$\_$final$)$

print$("$Fita final:", fita$\_$final$)$