Draw the state diagram of a DPDA accepting all function bodies

$\{\}\{$s;$\}\{$s;s;$\}\{$s;w$\{$s;$\}$s;$\}\{$w$\{$s;s;w$\{$s;$\}\}$s;$\}....$

More specifically, we consider exactly the function bodies generated by the following grammar rules, where B is the start symbol:

B $->\{\}|\{$L$\},$ L $->$ I $|$ I L$,$ I $->$ s; $|$ wB

where $$;$$ is an element of the terminal alphabet. Use as a guide Ex$.7\mathrm{.}8\mathrm{.}2$ of the text. In particular, show clearly the sets F$\backslash$lambda and F$\backslash$sigma of follow$-$up symbols as discussed in the text. Generally speaking, there should be a state corresponding to each such set, but if two of these sets are equal you can simply use one state corresponding to both.