Attempted: 2

Write a function called `sum_n_primes`

which takes an
integer `n`

and computes the sum of the first n prime
numbers.

Attempted: 2

The Fibonacci series is given by adding the previous 2 terms of the
series. The first 2 terms of the series are 0 and 1. Your task is to
write a function called `fibonacci`

which takes in a positive
integer `n`

and returns the `nth`

Fibonacci value.
The starting few values in the series is as follows 0, 1, 1, 2, 3, 5, 8,
13, …

Attempted: 3

Write a function which takes in `n`

numbers
(`int`

or `float`

) and returns the sum of the
numbers.