plz do this on a paper then I will upvote consider the language $L$ which accepts all strings of a$\text{'}$s and b$\text{'}$s where each string consists of three consecutive b$\text{'}$s$.$ Construct the following for the language $L$

i$.$ Derive the strings which belong to the $L.$

ii$.$ Design NFA for L$.$

iii. Design equivalent DFA for the constructed NFA $($ii$)$

iv$.$ Minimize the DFA