Which of the following algorithms correctly traverses all elements of a one-dimensional array A from index lower_bound to upper_bound?

1. AStep 1: SET I = upper_bound Step 2: Repeat Steps 3 to 4 while I >= lower_bound Step 3: Apply process to A[I+1] Step 4: SET I = I - 1 Step 5: EXIT
2. BStep 1: SET I = lower_bound Step 2: Repeat Steps 3 to 4 while I <= upper_bound Step 3: Apply process to A[I] Step 4: SET I = I + 1 Step 5: EXIT
3. CStep 1: SET I = lower_bound Step 2: Repeat Steps 3 to 4 while I < upper_bound Step 3: Apply process to A[I] Step 4: SET I = I + 1 Step 5: EXIT
4. DStep 1: SET I = lower_bound + 1 Step 2: Repeat Steps 3 to 4 while I <= upper_bound Step 3: Apply process to A[I] Step 4: SET I = I + 1 Step 5: EXIT