$1.$ Fibonacci sequence: $1,1,2,3,5,8,13,...,$

Write a program using a recursive function that requests the index n as input and then displays the number of the Fibonacci sequence at that index.

Sample Output:

Enter an index: $5$

The Fibonacci number at index $5$ is $8$

$2.$ Write your own function to remove an element from a list $($name it remove$\_$element$).$ Your function should accept a number and a list and return the list with that element removed. So for example:

remove$\_$element$(2,[4,1,2,6,9])$

should return $[4,1,6,9]$