fundamental structures i need help with the questions below

(1) List the Big-Oh notation that corresponds to each of the following examples. Afterwards, list them by the order of complexity from LEAST to MOST ( 5 pts. each identification, 20 pts for correct order (1.1) A bacteria that doubles itself every generation N. (1.2) Flipping back and forth through a phonebook with N pages to find a number. (1.3) Pulling a single ball out of a pit filled with N balls. (1.4) Searching the N rooms in a house for your keys. (1.5) Trying to crack a password with N characters. (1.6) Breaking your N chores into smaller sub-tasks to get them done more efficiently