Consider a scenario where we have an array with 50 elements. Now suppose we want to look out for an element within the complete list of elements in the data structure. But generally, the conventional approaches utilize more time and memory. So, what alternate approach we can use to find an element such that optimal time-space are utilized. Demonstrate that with the help of a cpp program. [10 Marks] Q2. We have an array with some finite elements. If we want to make room for another element within the set of elements without hindering/moving the previous members of the data structure. Then how can we achieve that. Demonstrate your approach with the help of an algorithm as well as a cpp program. [10 Marks] Q3(a). Consider the array Vehicle which records the number of vehicles sold each year from 1990 through 2020. Suppose VEHICLE appears in memory, Base(VEHICLE)=100, w=4. Calculate the address of the array element for the year k-2011? [05 Marks] Q3(b). Suppose we have an array with some finite elements. If we want to rearrange its element in a certain organized arrangement which may involve the displacing of previous members of the data structure. Establish how that can be done with the help of certain systematic steps. [05 Marks]