I need help figuring this problem out. Have to show work

Proceed as in example 3 in section 6.1 to rewrite the given expression using a single power series whose general term involves xk. ∞ n(n − 1)cnxn − 2 n = 2 − 4 ∞ ncnxn n = 1 + ∞ cnxn n = 0

Aword processing program requires a 7- digit registration code made up of the digits 1,2,4,5,6,7 and 9 each number has to be used and no number can be used mor than once how many codes are possible

A(1,1) b(-3,0) c(-4,-1) d(3,-2) drag it to correct position