il Outcome 2 Differentiate between methods and functions and use them correctly in a computer program Performance criteria Type Evidence PC2.16 Write functions that represent different mathematical Application expressions e.g. BMI, unit conversion and implement them within a program PC2.17 Define recursion as a technique where a function invokes Knowledge itself and discuss the reasons why one weuld use recursion PC2.18 Implement recursion techniques within a program to invoke Application a function within itself Specific evidence requirements PC2.16-PC2.18 One individual practical assignment including two tasks Task 1: Create a Python program that includes a function and performs a specific task related to a real-life problem Write a Python function that takes a number as a parameter and check the number is prime or not Note: A prime number (or a prime) is a natural number greater than 1 and that has no positive divisors other than I and itself. Test your code and show the output. Task 2: Apply the concept of recursion to solve a given real-life problem Answer the following question : Define recursion as a technique where a function invokes itself and discuss the reasons why one would use recursion