1. Using Big-O notation, list in a table the best, average and the worst case performance for each of the following algorithms: Linear Search Binary Search Bubble Sort Selection Sort Insertion Sort Give one example for each case and explain