Part $2$ Select all configurations that T will go through on input #$0$#$11$#:$($a$)$ q$0$#$00$#$1$# $($b$)$ xq$50$#$11$# $($c$)$ xy#q$711$# $($d$)$ xy#zzq$5$#$($e$)$ #y#zz#qacc$5$ points Part $3$ Select all words that are members of L$($T$),$ that is all words that are acceptedby the Turing Machine T$.($a$)$ #$00$#$1$# $($b$)$ #$00$#$11$#$($c$)$ ##$($d$)$ #$000111$#$($e$)$ #$0$#$0$#$($f$)$ #$0000$#$1111$#$($g$)$ #$0$#$1($h$)$ #$0$#$1$#$0$#$($i$)$ #$000$# $($j$)$ #$0$#$1$#Part $4$ Select all items that are correct statements about T:$($a$)$ The language L$($T$)$ is regular.$($b$)$ The language L$($T$)$ is context$-$free.$($c$)$ The language L$($T$)$ does not contain any palindromes. $($d$)$ The language L$($T$)$ us a subset of L$($#$0+$#$1+$#$).($e$)$ Every subset of L$($T $)$ that is a regular language is finite.