Do that above using c++ and function of each for bubble sort for selection sort and for insertion sort *using pointers.

Note: dont use indices i.e. P[i], rather use *(p+i) notations to access the value.

3. Implement Bubble sort, Selection sort and Insertion sort using pointers. Create function for all the three types of sort. Create three locals one dimensional arrays and pass a pointer to an array to each function. Each function will use that pointer to sort the array