Consider the following program: [x := a + b] 1 ; (while [x > 0]2 do [x := x − (a + b)]3 ); [x := x + (a − b)]4 Write down the equations for available expressions analysis, reaching definition analysis, very busy expression analysis, and liveness analysis. Calculate the solution for available expression analysis using the algorithm we discussed in class.