9 The has a 1n chessboard. She wants to colour each square of this chessboard with either blue or green. But she does not want consecutive blue squares. Let hn be the number of ways in which the can do it. 9.1 Recursion Find a recursive formula of hn. Answer: hn+2= for all n1. 9.2 Closed formula Find a closed formula of hn without using a Answer: \[ h_{n}=\text { _ }_{-} \quad \text { for all } n \geq 1 . \] 9.3 Explanation Explain how your got your formula of hn. Answer: 9 The has a 1n chessboard. She wants to colour each square of this chessboard with either blue or green. But she does not want consecutive blue squares. Let hn be the number of ways in which the can do it. 9.1 Recursion Find a recursive formula of hn. Answer: hn+2= for all n1. 9.2 Closed formula Find a closed formula of hn without using a Answer: \[ h_{n}=\text { _ }_{-} \quad \text { for all } n \geq 1 . \] 9.3 Explanation Explain how your got your formula of hn