$1.$ Design the DFA that generates binary strings ending in $01($Sonu

$01$ ile biten binary stringler $$reten DFA'y tasarlayiniz$).$

Sigma$=\{0,1\}$

$2.$ Design a language using PDA so that two a$\text{'}$s do not come together and b$\text{'}$s come together at most twice in the binary strings it produces $($rettigi binary stringlerde iki a yanyana gelmeyen ve b'ler de en fazla iki kez yanyana gelen dili PDA ile tasarlayintz$).$ Sigma$=$fa$,$ b$\}$

$3.$ Design a Turing machine that accepts the number of b$\text{'}$s multiples of $3$ in the binary strings it produces $($rettigi binary stringlerin i$$erisinde b'lerin sayist $3\text{'}$n katz olanlar kabul eden Turing makinesi tasarlayinz$).$ Sigma $=\{$a$,$ b$\}$ DESIGN THE QUESTIONS GIVEN ABOVE IN JFLAP OR IN TABLE FORM. PLEASE SPECIFY WHICH STATES ARE GOING TO WHICH STATUS?

PLEASE DO NOT USE CHATGPT WHEN ANSWERING THE QUESTIONS.