1. Write the trace the Selection sort algorithm to show all the passes and all the comparisons in every pass.

2. Write a program that fills an array with 100 random integers between 0 and 9 and
outputs the count of each number. (you may use another one-dimensional array to
store the counts)

For each of the following claims, determine whether they are true or false. justify your determination (show your work). if the claim is false, state the correct asymptotic relationship as o, θ, or ω. unless otherwise specified, lg is log2.(a) (b) (c) (d) (e) (f) (g) (h) (i) (j)n+1 =22n =2n =1 =ln2 n =n2 +2n−4 =33n = 2n+1 =√n = 10100 =o(n4) o(2n)θ(2n+7 ) o(1/n)θ(lg2 n) ω(n2 )θ(9n ) θ(2n lg n )o(lg n) θ(1)

What is the algorithm for building a binary tree program

Which part of the cpu accepts data?