Discuss the time complexity of common dictionary operations like inserting, deleting, and searching for a key-value pair.

Create and test predictions regarding the insertion sort and selection sort running times for arrays with just two key values, assuming that the values are equally likely to occur.

Python

For the terminology stored in each cell of the table below, choose a corresponding key point from the Hints section below and put the number (not the text).  Some choices may be used multiple times or not at all. Dictionary(map) ADT: Quicksort: Mergesort: Radix sort over big integer numbers: Insertion sort: Selection sort: Heapsort: Counting sort over a small range of integers: Bucket sort: Bubble sort: Depth-First-Search: Bellman-Ford’s algorithm: Prim’s algorithm: Dijkstra’s algorithm: 0-1 knapsack problem: Hints : sorting: continuously swapping elements while finding the next number to add in the sorted sublist sorting: an improved selection sort - extracting the root of a binary tree to get the maximal/minimal key sorting: removing one element from the input data, then finding the location it belongs within the sorted sublist, and inserts it there sorting: in general, sorting the least significant position first sorting: finding  the smallest element in the…

There are advantages and disadvantages to both sequential and binary search procedures, which are two types of search tactics.

Describe a situation where an array is more suitable than a linked list in terms of access and retrieval efficiency. Justify your choice.

Assessments of algorithmsTime-based calculation of the algorithmic complexity of binary search. Please provide specific instructions.

def delete task (..., ...): I param: task_collection (list) holds all tasks; param: an integer ID indexes each task (stored as a dictionary) (str) - a string that is supposed to represent an integer ID that indexes the task in the list returns: 0 if the collection is empty. -1 - if the provided parameter is not a string or if it is not a string that contains a valid integer >=0 representing the task's position on the list. Otherwise, returns the item (dict) that was removed from the provided collection. 11 11 11

Compare the pros and cons of using Dictionary and 2D array to store Histograms ?

Create and test assumptions regarding the running times of insertion sort and selection sort for arrays with just two key values, assuming the values are equally likely to occur.