Consider the following loop construct:X := 1repeat Y := N while Y > 0 do . . . // something (the ellipsis) Y := Y – 1 endwhile X := X + Xuntil X > N * NCategorize its efficiency in terms of the variable N using big-O notation. Also, assume that the statements representedby the ellipsis require four main memory accesses with eachaccess requiring 1 microsecond, and two disk file accesseswith each requiring 1
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured