Assume that your computer has special hardware that finds the minimum of k (or fewer) elements in one comparison step. Your answers to this question should have n and k as parameters. (a) Design (in English) an efficient algorithm based on Merge sort to sort n elements using this special hardware. (This is an upper bound.) (b) Analyze your algorithm. Get the higher order term exactly. (c) Use decision trees (no need to draw) to find a lower bound for sorting when using this special hardware. (d) Compare your upper and lower bounds

Melissa needs to add a topic to an email that she will send to her teacher. choose the name of the field where she should type her topic.

Me with this program in c++ ! computers represent color by combining sub-colors red, green, and blue (rgb). each sub-color's value can range from 0 to 255. thus (255, 0, 0) is bright red. (130, 0, 130) is a medium purple. (0, 0, 0) is black, (255, 255, 255) is white, and (40, 40, 40) is a dark gray. (130, 50, 130) is a faded purple, due to the (50, 50, 50) gray part. (in other word, equal amounts of red, green, blue yield gray).given values for red, green, and blue, remove the gray part. ex: if the input is 130 50 130, the output is: 80 0 80. thus, find the smallest value, and then subtract it from all three values, thus removing the gray.

Read “suburban homes construction project” at the end of chapters 8 and 9 (in the textbook) and then develop a wbs (work breakdown structure) in microsoft excel or in microsoft word (using tables)