I want the solution step by step

I want the answer of every question step vise

1- Prove that n!+2 is divisible by 2 for all integers n22 using mathematical induction. (20p) 2- A) How many 8 bit strings contain exactly seven l's ? (6p) B) How many 8 bit strings contain at least seven 1's ? (7) C) How many 8 bit strings contain at most three 1's ? (7) 3- How many times the innermost loop will be iterated if the following algorithm segment is run ? (20p) for k:=1 to 20 for j:=k to 25 for i=j to 30 [statements in the body of the innermost loop] next i next j next k 4. There is a sequence a, a, a,........ Which satisfies the recurrence relation a =5ax.1-6ak for k22. Find the explicit formula for this sequence. (20p) 5- There is a sequence a, a, a,....... Which satisfies the recurrence relation a =6a-1-9a2 for k22. Find the explicit formula for this sequence. (20p)