Repeat this process until the last number is reached. Compare the first two numbers in the list. If the second number is larger than the first number, swap the two numbers. Repeat this process....

Repeat this process until the last number is reached. Compare the first two numbers in the list. If the second number is larger than the first number, swap the two numbers. Repeat this process. Compare the first two numbers in the list. If the first number is larger than the second number, swap the two numbers. Repeat with the second number and third number, and so on until the last number is reached. Repeat this process starting from the beginning of the list until no more numbers are swapped. Which is an example of abstraction in computational problem solving? An algorithm that can sort 10 numbers is more efficient than an algorithm that can sort 20 numbers An algorithm that can sort 10 numbers can also sort 5 numbers or 20 numbers. An algorithm that can sort 10 numbers only works with positive numbers An algorithm that can sort 10 numbers can also determine if the numbers are prime Which of the following lists data in increasing levels of abstraction?