Suppose you have an array of sorted data. What would be the worst case asymtotic runtime of the following functions? Select the tightest. Please explain for each funtion. insert() search() delete() minimum() maximum()

Assign letter grades O solutions submitted (max: 1) In the attached spreadsheet, you are given homework grades of 25 students. Sheet 1 (hw1) stores the first homework grades, Sheet 2 (hw2) is the second homework grades and so on. Use either xlsread() or readmatrix() to import the given data into Matlab. Once you have the data in Matlab; 1- Create separate arrays for each homework, name them as hw1, hw2, hw3, hw4, hw5 2- Create an average grade array named hwAvg. Store the average homework grade in hwAvg using the below weights Homework 1, 2: each 15% Homework 3, 4 : 20% Homework 5: 30% 3- Create an array named letterGrade to store letter grades, this will be an array of strings. • 4- Preallocate the letterGrade array. Make sure it has the same length as hwAvg array. 5- Assign letter grades from hwAvg array using the grading policy shown below 100 - 90 : A <90 - 80 : B <80 - 70:C <70 - 60 : D <60 :F It is recommended that you download the file, see what it looks like, figure the steps…

Without importing any Lib:

Create a function that takes the dimensions of two triangles (as arrays) and checks if the first triangle fits into the second one. Examples does TriangleFit([1, does TriangleFit([1, does TriangleFit([1, does TriangleFit([1, 1, 1], [1, 1, 1]) → true 1, 1], [2, 2, 2]) → true 2, 3], [1, 2, 2]) → false 2, 4], [1, 2, 6]) → false