b$.$ What is the regular expression accepted by the following automaton?

$[4$ marks$]$

Write a grammar $($regular or context free$)$ for the language accepted by the following automaton?

$[4$ marks$]$a$)$ Heapify the following tree, make every step clear. $($Min heap$)($a$)$ Heapify the following tree, make every step clear. $($Min heap$)(7$ marks$)$