Suppose that you need to maintain a collection of data whose contents are fixed; you need to search for and retrieve existing items, but never need to add or delete items.  You may assume that data can fit in the computer’s memory. data structure is the most efficient one to use for this task? a sorted array or a linked list? Explain your answer.

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 and contrast the different types of linked lists, highlighting their advantages and disadvantages in terms of memory usage and operations like insertion and deletion.

Building a histogram. Write a python program to find the number of occurrences of each word in a text file. The first part of the task is to open the file, then create a dictionary to read each word from the file and compute the word's frequency (consider words written in capital letters equal words written in lower case). At the end build two lists, one with each word in the file (call it words_list) and a second list with the number of occurrences of the word in the file (call it words_count). Do not make distinction among words with capital letters. \n",

What are the advantages and disadvantages of using sequential search algorithms as opposed to binary search methods, for instance?