In this exercise we will look at analysis of algorithms. By the end of this exercise you should be able to informally determine the order of looping structures. Use the last page for your own sake. For the following code segments, indicate the Big-O (order) of each segment assuming step is the significant step of the algorithm. 1. for ( int i=0;i<>