This problem has to do with stable sorting algorithms. (a) Recall from the class that we claimed that counting sort is a stable sorting algorithm. Prove that counting sort is in fact stable. (b) Is deterministic quicksort (i. e. when we always choose the first element to be the pivot) a stable sorting algorithm

Why the bear has a slunky tail determine the meaning of the word slunk in the story

Develop a function to create a document in the mongodb database “city” in the collection “inspections.” be sure it can handle error conditions gracefully. a. input -> argument to function will be set of key/value pairs in the data type acceptable to the mongodb driver insert api call b. return -> true if successful insert else false (require a screenshot)

3. what is the output of the following statements? temporary object1; temporary object2("rectangle", 8.5, 5); temporary object3("circle", 6, 0); temporary object4("cylinder", 6, 3.5); cout < < fixed < < showpoint < < setprecision(2); object1.print(); object2.print(); object3.print(); object4.print(); object1.set("sphere", 4.5, 0); object1.print();