write python code to convert nfa to dfa change this code i need like this but chagned one # nfaDict $=\{$

# $\text{'}0\text{'}$: $\{\text{'}$a$\text{'}$: $\{\text{'}1\text{'}\},\text{'}$b$\text{'}$: $\{\text{'}2\text{'}\}\},$

# $\text{'}1\text{'}$: $\{\text{'}$a$\text{'}$: $\{\text{'}3\text{'}\}\},$

# $\text{'}2\text{'}$: $\{\text{'}$b$\text{'}$: $\{\text{'}3\text{'}\}\},$

# $\text{'}3\text{'}$: $\{\text{'}$a$\text{'}$: $\{\text{'}4\text{'}\},\text{'}$b$\text{'}$: $\{\text{'}4\text{'}\}\},$

# $\text{'}4\text{'}$: $\{\text{'}$a$\text{'}$: $\{\text{'}5\text{'}\},\text{'}$b$\text{'}$: $\{\text{'}5\text{'}\}\},$

# $\text{'}5\text{'}$: $\{\text{'}$eps$\text{'}$: $\{\text{'}0\text{'}\}\}$

# $\}$

# nfaDict $=\{$

# $\text{'}0\text{'}$: $\{\text{'}$a$\text{'}$: $\{\text{'}1\text{'},\text{'}3\text{'}\},\text{'}$b$\text{'}$: $\{\text{'}2\text{'}\},$ 'eps': $\{\text{'}4\text{'}\}\},$

# $\text{'}1\text{'}$: $\{\text{'}$a$\text{'}$: $\{\text{'}2\text{'},\text{'}4\text{'}\},$ 'eps': $\{\text{'}3\text{'}\}\},$

# $\text{'}2\text{'}$: $\{\text{'}$c$\text{'}$: $\{\text{'}1\text{'}\},\text{'}$d$\text{'}$: $\{\text{'}3\text{'}\},$ 'eps': $\{\text{'}4\text{'}\}\},$

# $\text{'}3\text{'}$: $\{\text{'}$c$\text{'}$: $\{\text{'}4\text{'}\},\text{'}$d$\text{'}$: $\{\text{'}2\text{'}\}\},$

# $\text{'}4\text{'}$: $\{\text{'}$a$\text{'}$: $\{\text{'}3\text{'},\text{'}4\text{'}\},\text{'}$b$\text{'}$: $\{\text{'}0\text{'}\},$ 'eps': $\{\text{'}2\text{'}\}\},$

# $\}$

# j $=$ nfaDict$[\text{'}2\text{'}][\text{'}$c$\text{'}]$

# print$($j$)$

# nfaDict $=\{$

# $\text{'}$A$\text{'}$: $\{\text{'}1\text{'}$: $\{\text{'}$B$\text{'}\},\text{'}0\text{'}$: $\{\text{'}$E$\text{'}\}\},$

# $\text{'}$B$\text{'}$: $\{\text{'}1\text{'}$: $\{\text{'}$C$\text{'}\},$ 'eps': $\{\text{'}$D$\text{'}\}\},$

# $\text{'}$C$\text{'}$: $\{\text{'}1\text{'}$: $\{\text{'}$D$\text{'}\},$ 'eps': $\{\text{'}$F$\text{'}\}\},$

# $\text{'}$D$\text{'}$: $\{\},$

# $\text{'}$E$\text{'}$: $\{\text{'}0\text{'}$: $\{\text{'}$F$\text{'}\},$ 'eps': $\{\text{'}$B$\text{'},\text{'}$C$\text{'}\}\},$

# $\text{'}$F$\text{'}$: $\{\text{'}0\text{'}$: $\{\text{'}$D$\text{'}\},\text{'}1\text{'}$: $\{\text{'}$E$\text{'}\}\}$

# $\}$

# nfaDict $=\{$

# $\text{'}1\text{'}$: $\{\text{'}$eps$\text{'}$: $\{\text{'}2\text{'},\text{'}5\text{'}\}\},$

# $\text{'}2\text{'}$: $\{\text{'}$a$\text{'}$: $\{\text{'}3\text{'}\}\},$

# $\text{'}3\text{'}$: $\{\text{'}$b$\text{'}$: $\{\text{'}3\text{'}\},$ 'eps': $\{\text{'}4\text{'}\}\},$

# $\text{'}4\text{'}$: $\{\text{'}$a$\text{'}$: $\{\text{'}4\text{'}\}\},$

# $\text{'}5\text{'}$: $\{\text{'}$a$\text{'}$: $\{\text{'}6\text{'}\},$ 'eps': $\{\text{'}7\text{'}\}\},$

# $\text{'}6\text{'}$: $\{\text{'}$b$\text{'}$: $\{\text{'}7\text{'}\}\},$

# $\text{'}7\text{'}$: $\{\text{'}$b$\text{'}$: $\{\text{'}8\text{'}\},$ 'eps': $\{\text{'}5\text{'}\}\},$

# $\text{'}8\text{'}$: $\{\text{'}$a$\text{'}$: $\{\text{'}9\text{'}\}\},$

# $\text{'}9\text{'}$: $\{\}$

# $\}$

# nfaDict $=\{$

# $\text{'}1\text{'}$: $\{\text{'}$eps$\text{'}$: $\{\text{'}2\text{'},\text{'}3\text{'}\}\},$

# $\text{'}2\text{'}$: $\{\text{'}$a$\text{'}$: $\{\text{'}4\text{'}\},$ 'eps': $\{\text{'}5\text{'}\}\},$

# $\text{'}3\text{'}$: $\{\text{'}$a$\text{'}$: $\{\text{'}3\text{'}\},\text{'}$b$\text{'}$: $\{\text{'}6\text{'}\}\},$

# $\text{'}4\text{'}$: $\{\text{'}$b$\text{'}$: $\{\text{'}5\text{'}\}\},$

# $\text{'}5\text{'}$: $\{\text{'}$eps$\text{'}$: $\{\text{'}2\text{'}\}\},$

# $\text{'}6\text{'}$: $\{\text{'}$b$\text{'}$: $\{\text{'}6\text{'}\}\}$

# $\}$

# nfaDict $=\{$

# $\text{'}0\text{'}$: $\{\text{'}$eps$\text{'}$: $\{\text{'}3\text{'}\}\},$

# $\text{'}1\text{'}$: $\{\text{'}$b$\text{'}$:$\{\text{'}1\text{'}\},\text{'}$a$\text{'}$:$\{\text{'}0\text{'}\}\},$

# $\text{'}2\text{'}$: $\{\text{'}$b$\text{'}$:$\{\text{'}0\text{'}\},\text{'}$a$\text{'}$:$\{\text{'}2\text{'},\text{'}3\text{'}\}\},$

# $\text{'}3\text{'}$: $\{\text{'}$a$\text{'}$:$\{\text{'}1\text{'}\}\}$

# $\}$

# nfaDict $=\{$

# $\text{'}1\text{'}$: $\{\text{'}$b$\text{'}$: $\{\text{'}2\text{'}\},$'eps': $\{\text{'}3\text{'}\}\},$

# $\text{'}2\text{'}$: $\{\text{'}$a$\text{'}$: $\{\text{'}2\text{'},\text{'}3\text{'}\},\text{'}$b$\text{'}$:$\{\text{'}3\text{'}\}\},$

# $\text{'}3\text{'}$: $\{\text{'}$a$\text{'}$: $\{\text{'}1\text{'}\}\},$

# $\}$

# nfaDict $=\{$

# $\text{'}0\text{'}$: $\{\text{'}$a$\text{'}$: $\{\text{'}0\text{'},\text{'}1\text{'}\},\text{'}$b$\text{'}$: $\{\text{'}0\text{'}\}\},$

# $\text{'}1\text{'}$: $\{\text{'}$b$\text{'}$:$\{\text{'}2\text{'}\}\},$

# $\text{'}2\text{'}$: $\{\}$

# $\}$

nfaDict $=\{$

$\text{'}1\text{'}$: $\{\text{'}$a$\text{'}$: $\{\text{'}3\text{'}\},$'eps': $\{\text{'}2\text{'}\}\},$

$\text{'}2\text{'}$: $\{\text{'}$a$\text{'}$:$\{\text{'}4\text{'},\text{'}5\text{'}\}\},$

$\text{'}3\text{'}$: $\{\text{'}$b$\text{'}$:$\{\text{'}4\text{'}\}\},$

$\text{'}4\text{'}$: $\{\text{'}$a$\text{'}$:$\{\text{'}5\text{'}\},\text{'}$b$\text{'}$:$\{\text{'}5\text{'}\}\},$

$\text{'}5\text{'}$: $\{\}$

$\}$

strt $=\text{'}1\text{'}$ # should get input form user

all$\_$connected$\_$states $=$ set$()$

checked $=$ set$()$

# Func$-1//$ a function to find connected states those are our mainStates that we can reach

def find$\_$connected$\_$states$($nfaDict$,$ start$)$:

global all$\_$connected$\_$states

key$\_$of$\_$start $=$ nfaDict$[$start$]$

straight$\_$reachable$\_$states $=$ set$()$

temporary $=$ list$($key$\_$of$\_$start.values$())$

for dic in temporary:

straight$\_$reachable$\_$states.update$($dic$)$

all$\_$connected$\_$states.update$($straight$\_$reachable$\_$states$)$

all$\_$connected$\_$states.update$($start$)$

checked.add$($start$)$

for stt in straight$\_$reachable$\_$states:

if stt not in checked:

find$\_$connected$\_$states$($nfaDict$,$ stt$)$

return all$\_$connected$\_$states

a $=$ find$\_$connected$\_$states$($nfaDict$,$ strt$)$

print$($f$\text{'}\{$a$\}$ Only these states are reachable from start state of $\{$strt$\}\text{'})$

print$("-------------------------------------------------------------")$

# Func$-2//$ a function for removing unreachables from nfaDict

def remove$\_$unreachable$\_$states$($Dictin$,$ a$=$find$\_$connected$\_$states$($nfaDict$,$ strt$))$:

global tempDict,tempNfaStates

tempDict $=$ Dictin

nfaPrimaryStates $=$ list$($nfaDict$.$keys$())$

for membr in a:

if membr in nfaPrimaryStates:

tempNfaStates $=$ nfaPrimaryStates

tempNfaStates.remove$($membr$)$

print$($f$\text{'}$State$($s$)\{$tempNfaStates$\}$ are not reacheable and removed'$)$

print$("-------------------------------------------------------------")$

for k in tempNfaStates:

del tempDict$[$k$]$

return tempDict

available$\_$States $=$ remove$\_$unreachable$\_$states$($