Given lst = [30, 1, 12, 14, 10, 0], how many elements are in lst? Whatis the index of the first element in lst? What is the index of the last element in lst? What is lst[2]? What is lst[-2]?

numpy array (([[-13,-38,22,-41,25], [-45,29,14,-34,-49], [26,21,-44,-25,0], [-30,-32,34,-39,-22], [-21,-36,0,18,37], [37,44,46,36,-37]]) Use indexing to extract the following slicers from the array [14,-34,-49], [-44,-25,0], [34,-39,-22] [[-30,-32,34,-39,-22], [-45,29,14,-34,-49], [-21,-36,0,18,37]] [25,34,46,-36]

convert C++ STL code into Python:int main(){      // empty map container    map<int, int> gquiz1;      // insert elements in random order    gquiz1.insert(pair<int, int>(1, 40));    gquiz1.insert(pair<int, int>(2, 30));    gquiz1.insert(pair<int, int>(3, 60));    gquiz1.insert(pair<int, int>(4, 20));    gquiz1.insert(pair<int, int>(5, 50));    gquiz1.insert(pair<int, int>(6, 50));    gquiz1.insert(pair<int, int>(7, 10));      // printing map gquiz1    map<int, int>::iterator itr;    cout << "\nThe map gquiz1 is : \n";    cout << "\tKEY\tELEMENT\n";    for (itr = gquiz1.begin(); itr != gquiz1.end(); ++itr) {        cout << '\t' << itr->first             << '\t' << itr->second << '\n';    }    cout << endl;    return 0;}

How should I insert nodes into a data structure so that insertion, deletion, and searching take less than O(n) time?

Consider the list {23, 23, 23, 23, 40}. What is the SD of the list when the values are in standard units?