3. How DAG (directed acyclic graph) is different from syntax tree? Draw the DAG for given expression (a+bc)+d+(a+bc)d+e draw the DAG. 4. Define activation records. Explain how it is related with runtime storage allocation. 5. Generate code for the following C program using any code generation algorithm. main() \{ int i,a,b,c,d,e; i=a+b(c+d)e \}