consider a 1 x n checkerboard. the squares of the checkerboard are to be painted white and gold, but no two consecutive squares may be painted white. let p(n) denote the number of ways to paint the checkerboard subject to this rule. find a recurrence relation for p(n) valid for n ⩾3