What would the time complexity be for the size operation if there were not a count

O(n)

Explanation:

If we wish to calculate the size of a list data structure where no count is available then the size operation will have a time complexity of O(n) where 'n' represents the number of existing elements of the list. This is because the operation will involve iterating through the entire list of size n via pointers till we reach the end of the list. So the time complexity will be n*O(1) or O(n).

answer; i believe the correct answer is : communicate safe work practices;

only #2 represents an object at rest on a table.

in #1, there is no normal force due to the table; the object is accelerating downward.

in #3, the vertical forces are not balanced; the object is accelerating downward.

in #4, neither the vertical nor the horizontal forces are balanced. the object is accelerating upwards and to the right.