the first part do it in table

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. best Average Worst Linear Search O(1) Binary Search Bubble Sort Selection Sort Insertion Sort * Example like that for all best. average and worst 1 4 1 Target:2 The best case for this algorithm will be when the element which is to be search is present at the first index of the given array