1. ( 2.5pts each) Find an O notation in terms of n for the number of times the statement x=x+1 is executed in the following pseudocode: a. For i=1 to n2/4 forj=1tonlognfork=1to1,000x=x+1 b. for i=1 to n forj=1toi2/2x=x+1 2. (10 pts each) Prove the bound for each expression using a formal definition. a. 7n3+3n+3=(n3) b. 100n2+(21)n=(n2)