With explain ,, thank you

Problem-1 Assume you have an array of N elements AIN]. Q: write an algorithm to sort the array in O(n.log.n) Q2: Write an algorithm to search an element of the array in o(n) Qa: Write an algorithm to search an element of the array in O(log.n) (1 Point) (1 Point) (1 Point) Problem-2 Assume you have a linked list of integer data. Qi: Write a method to count the data in the linked list (1 Point) Q2: Assume that the data in the linked list are sorted. Write a method to search for an element x and calculate its complexity Big-Oh (1 Point)