7.We have seen that the minimum number to move a Tower of Hanoi with n disks fromthe left-most peg to the right-most peg is I,-2-1,where we argued via induction.Wehave also seen that H,satisfies H-2H+1.Use the method of linearnonhomogeneous recurrence relation to obtain the same formula.(Hint:The recurrence relation is of degree 1,so its homogeneous part has a characteristicequation that is linear.For the particular solution ph,use the guess-form A+Bn.Alsorecall that H-1.)[15 pts]

**题目答案请扫描下方二维码查看。**