Given the following class, Please complete the class implementation and write a main function to test the class.

class sorting$\_$algorithms

$\{$

public:

sorting$\_$algorithms$()$; $//$constructor

void initialize$()$; $//$get the list size from the user and then fill the list with random numbers

$//$between $1$ and $1000$

void print$\_$list$($int$*)$; $//$print list contents

void bubble$\_$sort$()$;$//$perform Bubble sort algorithm

void insertion$\_$sort$()$;$//$perform insertion sort algorithm

void selection$\_$sort$()$; $//$perform selection sort algorithm

private:

int $*$list$0,*$list$1,*$list$2$; $//$lists are for bubble, insertion, and select sort

int len;

$\}$;

Your main function may look like:

int main$()$

$\{$

sorting$\_$algorithms mine;

mine.intitialize$()$; $//$get list length and initialize the needed lists. This function is given.

mine.print$\_$list$($list$0)$;

mine.bubble$\_$sort$()$;

mine.insertion$\_$sort$()$;

mine.selection$\_$sort$()$;

mine.print$\_$list$($list$0)$; $//$print the list sorted by bubble sort

mine.print$\_$list$($list$1)$;$//$print the list sorted by insertion sort

mine.print$\_$list$($list$2)$;$//$print the list sorted by selection sort

return $0$;

$\}$

void sorting$\_$algorithms::initialize$()$

$\{$

cout$<<$

Enter list size: $$;

cin $>>$ n;

list$0=$ new int$[$n$]$; $//$memory allocation to pointer list$0$

list$1=$ new int$[$n$]$; $//$memory allocation to pointer list$1$

list$2=$ new int$[$n$]$; $//$memory allocation to pointer list$2$

for $($int i $=0$; i $<$ n; i$++)$

$\{$

list$0[$i$]=$ rand$()\%1000+1$; $//$between $1$ and $1000$ for bubble sort

list$1[$i$]=$list$2[$i$]=$ list$0[$i$]$;$//$make two copies for other sorting algorithms

$\}$

$\}$