$1.$ Write a recursive method to calculate the nth Fibonacci number.

The Fibonacci sequence is a series of numbers where each number is the sum of the two preceding

ones, starting from $0$ and $1.$ So$,$ the sequence goes $0,1,1,2,3,5,8,13,21,34,$ and so on$.$

Your method should take an integer n as input and return the nth Fibonacci number. Assume that n

is a positive integer.

$2.$ Write a method that accepts an integer argument and returns the sum of all the integers from $1$ up

to the number passed as an argument. For example, if $50$ is passed as an argument, the method will

return the sum of $1,2,3,4,...50.$ Use recursion to calculate the sum.

Demonstrate your methods in a complete program