4.7)

CHAPTER 4 Algorithm Analysis e following code segments and determine the O() for t s. Assume an input size of n. 4.7 Evaluate each of the co best and worst case (a) sum = (c) for i in range( n) for j in range( n 2) for j in range( 5): for j in range( n): for i in range( n) sumj sum += 1 elif i % 2-0: sum +j sum += j (b) sum = 0 i=n else while i > : sum += 1 1=1/2 The slice operation is used to create a new list that contains a subset of items from a source list. Implement the sliceO function: 4.8