Executable C++ program shown in Figure Q2(c) is executing insertion and deletion algorithms by using array data structure. Write the complete output after the program execution. #include using...

Extracted text: Executable C++ program shown in Figure Q2(c) is executing insertion and deletion algorithms by using array data structure. Write the complete output after the program execution. #include using namespace std; class InsDel { private: int Array[]; public: void gen_array(); void disp_array(); void insertion (int ,int ); void deletion (int ); }; void InsDel::gen_array () { for (int i = 0; i < 8;="" i++)="" {="" array[i]="i*2;" void="" insdel::disp_array="" ()="" for="" (int="" i="0;" i="">< 8;="" i++)="" {="" cout="" «="" "arr["="" «="" i="" «="" "]:="" "="" «="" array[i]="" «="" endl;="">


Extracted text: ...Continue void InsDel::insertion (int pos_insert, int val_insert) int i; for (i = 8-1; i > pos_insert; i--) Array(i] = Array[i-1]; Array[i] - val_insert; void InsDel::deletion (int pos_delete) int i; for (i = pos_delete; i < 8-1;="" i++)="" {="" array[i]="" -="" array[i+1];="" array[i]="0;" int="" main()="" insdel="" jujukan;="" jujukan.gen_array="" ();="" jujukan.disp_array();="" cout="" «"\n\n\n";="" cout="" «="" "insertion:="" \n";="" jujukan.insertion="" (5,100);="" jujukan.disp_array();="" cout=""><"\n\n\n"; cout=""><« "deletion:="" \n";="" jujukan.deletion="" (2);="" jujukan.disp_array();="" return="">