Wile a progam fat can wilt implement (a) Selecton sort fo) Inserfion wort and (c) Butble sort in the same program, and main will call one of the method depending on the value of mortingCheice (delne this varable plobalyi. It the sotingChove is t, cal Selection sort, 2 it is 2 , cat insention sor and it E is 3 , call Gubble Sort. You need to write 4 functions: a) Selsction sort and Min function that tefurnt the mirimum inoer. b) Inserion Sort c) Bubble Sort Use fe pseudocodes given in power point notes on sorting algortmm part 1 You can use the main previoudy developed for Merge sort poobiem. This is due by Wednesday midhight. You can start working on this as soon as possible. and let me know ll you have ary question in fomornows class. What to mubrit Source code (downloadl, dont gree me acreen thet Alarg weth code oulpet For the sertingCneice, do the folowing: Right afer your header file and using nanespece ste, int sorting Cheice; If Declave the finctions void SelectionSortitemType N I int N: int Menitem Type AD, int \&, int Ny: void insertionSortitem Type A L int N); void BubbieGort/AemType MI I int N: In the main: a) Declare the array dynamicaly (thes has been diseused in the clake) using porter b) Alocate member to N number of dast c). Get user inputs (do not intaige the arays uxing ch stabenent to 18 up the arryy tor al N elemerts d) Get he value for soringChoice by propedy promptirg the user o) Wilte a switch stasement using sorting Choice as corboling pasametes, and calt Selectionsort tor case 1, Insertionisont for case 2, Bubbe Sort for case 3, and oetait. case display an error message siying that the choice is wiong. Outsibe the swich statement, display fhe sorted array with proper itie. It you have forgotten how to use swich stalement, use the following strictire swithy sortingChoice\} \{ case 1: SelectonSort(A. No break: ease 2: InserionSortic. No: break: and as on. defmilh: cout ee "Abt a correc choioe" ex end; ) Then display the sorted aray