Given a list $($array$)$ of $100,000$ positive integers $($unsorted$)$Given a list $($array$)$ of $100,000$ positive integers $($unsorted$),$ which you may assume to be all distinct. Describe $($describe only, don't write the algorithm$)$ how you would:

Print $($in any order$)$ the $1000$ numbers in the list with the lowest values.

a$)$ Describe $2O(n)$ algorithms to achieve the above.

b$)$ Describe $1O(nlogn)$ algorithm to achieve the above.

Note that the above time complexity doesn't have to be the worst case. It could also

be the average case. So either worst case or average case only.

You can use more data structures. Using extra space is not a problem. You can use

other algorithms such as sorting algorithms $($if applicable$)$ as part of your approach.

The other algorithms that you use as part of your approach could also have the

relevant complexities either as the worst case or average case., which you may assume

to be all distinct. Describe $($describe only, don$$t write the algorithm$)$ how you would:

Print $($in any order$)$ the $1000$ numbers in the list with the lowest values.

a$)$ Describe $2$ O$($n$)$ algorithms to achieve the above.

b$)$ Describe $1$ O$($n log n$)$ algorithm to achieve the above.

Note that the above time complexity doesn$$t have to be the worst case. It could also

be the average case. So either worst case or average case only.

You can use more data structures. Using extra space is not a problem. You can use

other algorithms such as sorting algorithms $($if applicable$)$ as part of your approach.

The other algorithms that you use as part of your approach could also have the

relevant complexities either as the worst case or average case.