# Question: Question 1: • Compare computers A and B that are running algorithms a and b. Algorithm a, takes time roughly equal to cynto sort n items, where C1 is a constant that does not depend on n. That is, it takes time roughly proportional to n?. In general, the code requires 4n2 instructions to sort n numbers. • Algorithm b, takes time roughly equal to canlgn, where Ign stands for log2 n and c2 is another constant that also does not depend on n. In general, the code requires 20nlgn instructions to sort n numbers. • Computer A executes 20 billion instructions per second and computer B executes 10 billion instructions per second. What is the time that it takes computers A and B to sort • 100 • 1000 • 10000 • 100000 • 1000000 numbers? – Free Chegg Question Answer

`Transcribed text From Image: Question 1: • Compare computers A and B that are running algorithms a and b. Algorithm a, takes time roughly equal to cynto sort n items, where C1 is a constant that does not depend on n. That is, it takes time roughly proportional to n?. In general, the code requires 4n2 instructions to sort n numbers. • Algorithm b, takes time roughly equal to canlgn, where Ign stands for log2 n and c2 is another constant that also does not depend on n. In general, the code requires 20nlgn instructions to sort n numbers. • Computer A executes 20 billion instructions per second and computer B executes 10 billion instructions per second. What is the time that it takes computers A and B to sort • 100 • 1000 • 10000 • 100000 • 1000000 numbers?`

`Answer:`