Which value of a queue is accessible?

The front item
  • The top item
  • The root
  • The bottom item
  • The rear item
  • The highest-valued item
  • The lowest-valued item

In a queue, we remove from (access) the front (and insert at the rear).