analysis using some of the sorting algorithms from this module. What is the difference in execution speed between the different sorting algorithms? In your paper, be sure to provide

Please answer in matlab code.   Download the data file AtlanticHurricanes20012020.csv, read in Matlab,and assign to the array hurrData:hurrData = readmatrix('AtlanticHurricanes20012020.csv'); Create a histogram plot showing the number of Hurricanes per year Label the x-axis Number of Hurricanes/year Label the y-axis Frequency Title the plot Hurricane Frequency Distribution 2001-2020 Save the figure as an emf file Create a bar plot showing annual hurricaines occurence Set the x = to the year; y = number of hurricanes Label the x-axis Year Label the y-axis Number of Hurricanes Title the plot Annual Hurricane Occurrence 2001-2020 Save the figure as an emf file. Create a line plot showing annual hurricaines occurence Set the x = to the year; y = number of hurricanes. The curve should be a red line with square symbols.  Label the x-axis Year Label the y-axis Number of Hurricanes Title the plot Annual Hurricane Occurrence 2001-2020 Save the figure as an emf file. Plot the histogram,  the bar…

Write an essay contrasting the pluses and minuses of skipping the list.

Subj:- Design & Anal Algorithms Please compelete all the three questions since it has to be answereda once. Thank you in advance. Three animals stand next to each other by size, as follows: An Elephant, followed by a Hippo, followed by a Panda bear, [E, H, P]. Your goal is to re-arrange them so that they are sorted in the opposite size-based order. You are only allowed to switch positions of neighboring animals. Do not use Insertion or Merge sort. Try to use your own strategy to re-arrange the array. (a) How many operations do you need to reverse the order of the three animals? (b) Let’s generalize the above. You have an array of n elements whose ordering you want to revers. Write pseudo code to do this. (c) How many operations do you need to reverse the ordering of an array of n? Your answer should be a function of n.

Make a list of all mathematical operations and sort them descendingly.

Sort the list “A, L, G, O, R, I, T, H, M” in alphabetical order by Selection sort .

9. Which of the algorithm design approach is used by Quick sort and Merge sortA. Branch and bound approachB. Greedy approachC. Dynamic approachD. Divide and Conquer approach

MATLAB. write code for all parts

In your essay, you should talk about both the benefits and the drawbacks of skipping the skip list.