Question: Consider the following nested loop construct. Categorize the efficiency in terms of the variable n using "big-O" notation. Suppose the statements represented by the elipsis (...) require four main memory accesses (each requiring one microsecond) and two discs file accesses (each requiring one millisecond). Show in milliseconds the amount of time this construct would require to execute if n were 1000.
Prepare this program in c language. Define each and every method in details.