3.1 3 Complexity of Algorithms 5 points What is the worst-case complexity of your selection sort algorithm (problem 1.1)? You can sure that all operations take constant time. Give a big-O estimate of the complexity in terms of the number of comparisons. Explain your answer in a few sentences (you do not have to give a formal proof) 3.2 10 points 3.2.1 Design a brute-force algorithm to find the first occurrence of a subestring t = tits in a string * = *92... where m s n. The inputs are the two strings t and the algorithm should return the index i such that I **+1...ditm or iOift is not found in . Write the pseudocode for your algorithm. (Don't worry too much about bolding, italics, etc., you can use nested btullet points to format indentation) 3.2.2 What is the worst-case complexity of your algorithm? You can assume that all operations take constant time. Give a big-O estimate of the complexity in terms of the timber of comparisons. Explain your answer in a few sentences (you do not have to give a formal proof) 3.3 5 points What is the worst- ce complexity of the algorithm bek! You can assume that all operations take constant time. Give a big-O estimate for the complexity in terms of the minber of operations. Explain your answer in a few sentences (you do not have to give a formal proof). function VIND ALL MODES: sorted integers) set to be the empty list count0 while su do valued count: while i Sandale do count count + 1 if count > modecount then milou cout set to consist of just else if it out then we tal return