Help! :/

Objectives: The main objectives of this project is to introduce you to recursion, and test your ability to work with some STI. functionalities. A review of your knowledge on working with templates, dynamic data structures, as well as manipulating dynamic memory, classes, pointers and iostream to all extents, is also included. Description: For the entirety of this project, you will work with STI.atd:vectors. You are free to implement any of the standard-provided functionalities with the libraries. For the first part of this a ssignment, you will Il create three recursive functions: three a) The vector resort Function (Recursive Sort) Paramcters List: Takes in a std: :vector by-Reference. Note that a std:avector as part of the STI. is a templated construct, hence the function will itself also need to be templated Hint This is the base parameter requirement. Any other parameters necessary for the function will depend on your specific implementation. EunctionalityThe function will have to perform Recursive Sorting of the vector elements. You may implement whichever sorting variant you wish (from the ones introduced in the Lab sections or any other established variant). Note: One of the most powerful naturally-recursive sorting algorithms is Quicksort Output: Nothing, since the std::vector is passed by reference it should be sorted at the return of the vector resort function. b) The vector research Function (Recursive Binary Search) Parameters List: Takes in a std::vector by-Reference, which has to be already sorted. Note that a std: :vector as part of the STI. is a templated construct, hence the function will itself also need to be templated. The function also takes in a const T& value, which is the one that is searched. Hint These are the base parameter requirements. Any other parameters necessary for the function will depend on your specific implementation. Eunctionality: The function will have to perform Recursive Binary Search htips/ien.wikipedia.omAwili/Binary scarch algorithm) as introduced during the class Lectures for the provided value in the atdsivector. A Binary Search is performed as follows: Pick the value in the middle of the container (the pivot); if the search item is less than the pivot narrow the search to the bottom half of the container, otherwise search the top half of the container. This is done recursively until the item is found and the index (since atdsivectors can have index-based access) where it is found is returned. (Return-1 if the item is not found) Qutput: The index (since atdisvectors can have index-based access) where the value is found is returned. Retun-1 if the item is not found). Extra: You may also devise an implementation that returns atdsivector