Basic Algorithm analysis, explanatikn needed for these particular parts of code

What is the tightest Big-O of each of the following code segments, assume n is the input and is a positive number? (Briefly explain your solution.) 1. (20 points) 1 x = 0 2 for i = 0 to n inclusive: for j - 0 to 1 inclusive: 4 if j0: 5 XX. 2 olse: 7 X--1 3 6 2. (20 points) 1 x = 0 2 for i = 0 ton inclusive: 3 for j = 0 to 1 inclusive: X X + 1 4