13 COMPSCI 120 Assignment Introduction to Time Complexity WEB RCISES "ythor ython H This assignment is worth 10% of your final mark. There are two questions in this assignment, and both ython In are worth equal marks. hon G thon S 1. An algorithm A has time complexity O(n log n) and runs for 109 ms on a problem of size 10. ython V about how long would you expect it to take to solve a problem of size 10'? thon D. ython N 2. Gedeskili's sort algorithm works as follows to sort a list in place: Starting from start of the list. wthon St scan until two succeeding items that are in the wrong order are found. Swap those items and go thon B back to the beginning. The algorithm ends when the end of the list is reached. What is the worst- thon 0 case running time for a list of size n? wthoni wthon TI wthon St thon D Due Fri the 27th of February 2020. wthon If they make as they go by. wthon W 'I love deadlines. I love the whooshing thon R thon F #thon L vthon A