Which of the following are true statements about queues?

The cost to delete from a queue implemented with dynamic allocation is O( (1).

The cost to insert into a queue standardly implemented with an array is O(1).

The cost to delete from a queue standardly implemented with an array is O(n).

The cost to insert into a queue implemented with dynamic allocation is O(n).