Problem 1. Consider the following loop construct:
X := 1
repeat
Y := N
while Y > 0 do
. . . // something (the ellipsis)
Y := Y - 1
endwhile
X := X + X
until X > N * N
Categorize its efficiency in terms of variable N using the big-O notation. Also, assume that the statements represented by the ellipsis require four main memory accesses with each access requiring 1 microsecond, and two disk file accesses with each requiring 1 millisecond. Express in milliseconds the amount of time this construct would require to execute if N = 1000.