Consider the problem of reversing a singly linked list. To take an example, given the linked list below:
the reversed linked list should look like
Which one of the following statements is TRUE about the time complexity of algorithms that solve the above problem in space?


- AThe best algorithm for the problem takes time in the worst case.
- BThe best algorithm for the problem takes time in the worst case.
- CThe best algorithm for the problem takes time in the worst case.
- DIt is not possible to reverse a singly linked list in space.

