Each algorithm operates on a list containing n elements, where n is a very large integer. I. An algorithm that accesses each element in the list twice.
II. An algorithm that accesses each element in the list n times.
III. An algorithm that access only the first 10 elements in the list, regardless of the size of the list.
Which of the algorithms run in reasonable time?
III only OR I, II, and III

answer; i believe the correct answer is the player pushing down on the floor;

add the following

answer is:

a). backstage view

explanation:

backstage view is the area where files and data about them is managed— creating, saving, printing, sending to others, inspecting for hidden metadata or personal information, and setting options. so in this way we can add many things to our document swiftly.

i hope you get the idea.