2. Consider the following partial grammar with denotational semantics for a statement list [1]; | { Ms(, s) = case of [1]; => M,(stmt>, Msl([1], s)) => Ms(, s) x = ,s)--error) then error else s' = ki,v/>,' for k = 1,2, ,n ,inNn,) where if(i,-=x) then vk' = Me(expr>,s) else vk' = VARMAP(ik,s) y + z (Me(expr>,s) = if(VARMAP(y,s)--undef OR VARMAP(z,s)--undef) then error else VARMAP(y) VARMAP(z) y * z (Me(expr>,s) = if(VARMAP(y,s)-=under OR VARMAP(z,s)=undef) then error else VARMAP(y) VARMAPz) Assuming the current state is (, ,), compute the state after the following assignment statements: a=a*b; b = a + c