Data structure

6. For an array containing 100 elements, provide the number of steps the following operations would take: a. Reading an element when index is known b. Searching for a value not contained within the array C. Insertion at the beginning of the array d. Insertion at the end of the array e.' Deletion at the beginning of the array f. Deletion at the end of the array 7. How many steps would it take to find all instances of a specific element in the array? How can we improve the search efficiency to find an element in the array? 9. What is the maximum number of steps it would take to perform a linear, and binary search of an array of size 1000? 10. What is set Data structure? Explain the similarities and differences between Array and Set data structures. 8