1) Consider 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

Classify its efficiency in terms of the variable N utilizing the big-O notation. Also, suppose that statements represented by the ellipsis need four chief memory accesses with each access requiring 1 microsecond, and two disk file accesses with each requiring 1 millisecond. Express this in milliseconds the amount of time this construct would be needed in order to execute if N = 1000.