Describe a recursive backtracking algorithm to compute a minimum- length addition chain for a given positive integer n. Dont analyze or optimize your algorithms running time, except to satisfy your own curiosity. A correct algorithm whose running time is exponential in n is sufficient for full credit. [Hint: This problem is a lot more like n Queens than text segmentation.]