Below is the C++ program for the implementation of a particular data structure (25 points). 1. First, describe in detail which type of data structure is used in the following C++ program and which technique of that data structure is employed. 2. Correct the bug(s) in the code. 3. Create your own example dataset with 4 elements and describe how each element is inserted into the appropriate location of the data structure in accordance with the insert function given in the code. Note here that you are supposed to show your calculations on where to insert each element and also draw the data structure visually. class Sample { int arr[11]; int size; public: int techniquel(int key){ return (key % 11); } int technique2(int key) { return (11 (key % 11)); } Sample() { size = 0; for (int i=0; i