The tower of Hanoi puzzle: 土 A Peg1 peg2 peg3 Initial state Peg1 peg2 peg3 goal state Objective: moving the disks (A, B, C) from peg1 to peg3 using peg2. Rules: - one disk can be moved at one time Cannot put a disk on a smaller one i. Find a heuristic function for the above puzzle. Using the suggested heuristic function, show how the state space would look like. ii.

Conway's Game of Life: This is a zero person game with the following rules: (see Wikipedia for example) Any live cell with fewer than two live neighbours dies, as if by underpopulation. Any live cell with two or three live neighbours lives on to the next generation. Any live cell with more than three live neighbours dies, as if by overpopulation. Any dead cell with exactly three live neighbours becomes a live cell, as if by reproduction. Remember the oscillator or blinker of 3 cells. You can also find this blinker on Wikipedia. 1 21 1 2 1 21 3. 4 6 4. 6. 4 8. 9 8 9 #1 #2. #3 5. Consider now these 3 creatures at stage 1: Show how they look like in the next two stages: stage 2 and stage 3. Explain how you get the answers Creature 1 Creature 2 Creature 3 (here creature 1 is the blinker of 3 cells, horizontally; creature 2 consists of two adjacent cells, creature 3 consists of 4 adjacent cells horiztonally) ww (d) Creature 1 (10%), (e) Creature 2 (8%), (f) Creature 3 (20%)

Could you explain in depth what the question is asking and have clear steps so I can understand the code, which should be in c++ Thank you!

State the difference between actual and formal parameters. Give an example each for clarification.