(Solved) : 1 Inserting Item Queue Takes O N T F 2 Data Structure Defined Finite Sequence Instruction Q35814423 . . . .

1. Inserting an item into a queue takes O(N).
t/f

2. A data structure is defined to be a finite sequence ofinstructions for obtaining a required output for any legitimateinput.

t/f

3. If x is a real value and A, B are constants, then we have (xA) B=X A+B.
t/f

4.Deletion from a typical priority queue takes the same order oftime complexity (big O notation) to inserting an item into apriority queue.
t/f

5. The selection sort takes fewer number of comparisons thanbubble sort if they apply to the same input items.

t/f

6. Arrays in Java are objects, not one of the primitivetypes.
t/f

7.Which of the following function grows slowest