For a standard array $($non$-$C$++$ specific$)$ containing $100$ elements, what is the number of steps it would take to complete a READ operation?

For a standard array $($non$-$C$++$ specific$)$ containing $100$ elements, what is the number of steps it would take to complete a SEARCH operation if the searched for value is NOT in the array?

For a standard array $($non$-$C$++$ specific$)$ containing $100$ elements, what is the number of steps it would take to complete an INSERTION operation at the beginning of the array?

For a standard array $($non$-$C$++$ specific$)$ containing $100$ elements, what is the number of steps it would take to complete an INSERTION operation at the end of the array?

For a standard array $($non$-$C$++$ specific$)$ containing $100$ elements, what is the number of steps it would take to complete a DELETION operation at the beginning of the array?

For a standard array $($non$-$C$++$ specific$)$ containing $100$ elements, what is the number of steps it would take to complete a DELETION operation at the end of the array?

For an ordered array $($non$-$C$++$ specific$)$ containing $100$ elements, what is the number of steps it would take to complete an INSERTION operation at the beginning of the array?

For an ordered array $($non$-$C$++$ specific$)$ containing $100$ elements, what is the number of steps it would take to complete an INSERTION operation at the end of the array?

For an ordered array $($non$-$C$++$ specific$)$ containing $100$ elements, a linear search takes how many steps for a search value NOT found in the array?

For an ordered array $($non$-$C$++$ specific$)$ containing $100$ elements, a binary search takes how many steps for a search value NOT found in the array?