question 4

1,2,3

everything else is requirement how to answer the question

2. Answer questions 2 to 4 of the General Requirements for both the worst-case and best-case running times of the function, and 3. Describe, and give examples of input that constitutes the best and worst case for the algorithm 4. The site and push_back methods of a vector run in constant time, therefore lines that include calls to these methods still only count as a single operation as per rule 1 Question 4 This function returns an array in dynamic memory that represents the matrix that is the result of multiplying the matrix Carral parameter by itself 1/ PRE represents a soare matrix of size rows Pows // PARA Ows represents the number of both rows and columns // POST: Returns a pointer to an array (matrix) of the same size as 1/ NOTE: values are indexed race.roc.-. -1.rice, inmatrixselmultiplyint , int rows) // Create result array int columns Pos; int result new int[rows columns): while ( Pows) inte; while (