Programming Language: Elixir

Please include screenshot of test case and answer clearly.

1) Create a class Sum - Returns the sum of all numeric values in the list.

2)Create a class Fibonacci accepts an integer argument, n, and returns the nth Fibonacci number. Assume the first two Fibonacci numbers are 1 and 1. That is, tailFib(1) == 1, tailFib(2) == 1. There is no tailFib(0). Your tail-recursive implementation must avoid the double recursive call. No O(2n )!