Please Help with Python Code!

the Fibonacci sequence are listed below. additional assert statements (there will be 6 in total). Choose the tests so that a correct implementation of the fib function passes but an incorrect implementation fails. Prime Numbers prime) is a natural number greater than 1 that is not a product of two smaller natural numbers. For example, 5 is prime because the only ways of writing it as a product, 15 or 51, involve 5 itself. implement at least 5 additional assert statements (there will be 6 in total). Choose the tests so that a correct implementation of the is prime function passes but an incorrect implementation fails. Sorting Algorithm them as a series of elements. How to Validate Make sure that each of your test_* functions contain at least 6 assert statements testing diverse inputs. Running the task4_test.py file should result in the output shown below. Testing fib(): All tests passed Testing is_prime(): All tests passed! Testing merge_sort ( ) All tests passed