I need the answer of this two question.

B. For each of the following growth functions, write beside it its order in Big-o notation. 1) 30n4( 2n5+ 200n) 2) n + login . B. D. State Whether the following statements are True/False 1) Doubly Linked List allows accessing list items from back only. (.........) 2) The Binary Search Tree ordering property can be expressed as: The key of each node is greater than or equal to the key of its left child, if any, and it is less than or equal to the key of its right child, if any. ( ...... ) 3) The Abstract Data Type (ADT) is thought of as abstract because the operations that are to be implemented are separated from the actual implementation........) 4) A queue as ADT is a linear list in which deletions can take place only at one end the "back" of the list and insertion at the "front