please solve this

7. Given the following Algorithm concerning a linear linked list L of n items? Procedure P1 (L, VAL) R: Pointer R= GetNode() Data (R)= vaL Next(R)=L L=R End Procedure What is the correct description of p19 1. P1 has a worst case of O(1) and best case of O(n) 2. P1 has a worst case of O(n) and best case of O(1) 3. P1 has a worst case of O(1) and best case of O(1) 4. P1 has a worst case f(n) and best case of O(n) 8. According to the following list of sorting algorithms, which one is the worst? 1. Selection Sort 2. Insertion Sort 3. Heap Sort 4. Quick Sort 5. Merge Sort 9. What is the role and the used technique in the function Fct? 1. Fct returns a n using recursion technique 2. Fct returns an using recursion technique 3. Fct retums an using divide and conquer technique 4. Fct returns an using decrease and conquer technique 5. Fct returns a n/2 using iterative technique 6. Fct returns a n using divide and conquer technique