$1.$ Write a program in python to compute the following series using for$/$while loop $($Fibonacci numbers$)$

$\backslash [$

$1+1+2+3+5+8+13+\backslash$ldots $\backslash$text $\{$ up to $\}15^\{\backslash$text $\{$th $\}\}\backslash$text $\{$ term $\}$

$\backslash ]$

$2.$ Write a program in python to reverse a given integer without converting them into a string. Example: $1356$ will be converted into $6531.$

$3.$ Consider the following string:

"The successful warrior is the average man, with laser$-$like focus."

i$.$ Write an expression to print the $\backslash (10^\{\backslash$text $\{$th $\}\}\backslash )$ character of the string

$($Expected output: $\text{'}$s$\text{'})$

ii$.$ Write an expression to print the first $21$ characters of the string

iii.Using positive index values, write an expression to print the last $17$ characters of the string

iv$.$Using negative index values, write an expression to print the last $17$ characters of the string

v$.$Write an expression to print the string in reverse

vi$.$Write an expression to find the length of the string

vii.Write an expression to convert the entire string to uppercase

viii.Write an expression to check if the word "fail" is in the string.

$4.$ Write a Python program that checks to see if a number N is prime. A simple approach checks all numbers from $2$ up to N $,$ but after some point numbers are checked that need not be checked. For example, numbers greater than $\backslash (\backslash$sqrt$\{\}\backslash$mathrm$\{$N$\}\backslash )$ need not be checked. Write a program that checks for primality and avoids those unnecessary checks. Remember to import the math module.

$5.$ Write a program in python to compute the following multiplication series. $\backslash (1*4*9*16^\{*\}25^\{*\}\backslash$ldots $\backslash )$ up to $8$ terms.