Given that backIndex references the last element of the queue stored in a contents array, which of the following best describes how to update backIndex when a new entry is successfully enqueued:

backIndex = ( backIndex + 1) % contents.length
  • frontIndex++
  • backIndex++
  • frontIndex = ( frontIndex + 1) % contents.length

There are no hints for this question