Just need $1$ and $3$ done here.

Using Big Oh notation, indicate the time requirement of each of the following tasks in the worst

case. Describe any assumptions that you make.

a$.$ After arriving at a party, you shake hands with each person there.

b$.$ Each person in a room shakes hands with everyone else in the room.

c$.$ You climb a flight of stairs.

d$.$ You slide down the banister.

e$.$ After entering an elevator, you press a button to choose a floor.

f$.$ You ride the elevator from the ground floor up to the $n^{th}$ floor.

g$.$ You read a book twice.

Describe a way to climb from the bottom of a flight of stairs to the top in time that is no better than

$O(n^2)$

Using Big Oh notation, indicate the time requirement of each of the following tasks in the worst

case.

a$.$ Display all the integers in an array of integers.

b$.$ Display all the integers in a chain of linked nodes.

c$.$ Display the $n^{th}$ integer in an array of integers.

d$.$ Compute the sum of the first $n$ even integers in an array of integers.