Given:

SinglyList L$,$ R; $//$ assume R is an empty list

What does the following code segment do$?$

Note: AddLast can be also called AddBack

while $(!$L$.$Empty$())\{$

R$.$AddLast$($L$.$Front$())$;

L$.$RemoveFront$()$;

$\}$

Select one:

a$.$ R becomes empty after the code.

b$.$ The above code segment reverses the elements

of List L$.$

c$.$ List R will contain the same order of items as in L

before executing the code