Do question 1-6 all parts. Must submit on time

BigOAssignment
1.
a. O(n) where n is the total number of people at the party
b. O(n^2) where n is the total number of people in the room
c. O(n) where n is the number of steps
d. O(1)
e. O(1)
f. O(1)
g. 2*O(n) = O(n) where n is the number of pages in the book
2. Algorithm :
First move one step up and take another step down. Then take two
steps up and two steps...