Suppose you have a variation of insertion sort that used binary search to find the correct slot for the ith number among the i-1 numbers that have been processed so far. What is the worst-case complexity of this new insertion sort be?

(A) O(n)
(B) O(n logn)
(C) O(n)
(D) O(n2 log)

You need a reliable network for about twenty-five computers that will be distributed across a large building. it is important that the network be relatively cheap. which topology should you use?

Consider the following code snippet: #ifndef cashregister_h#define cashregister_hconst double max_balance = 6000000.0; class cashregister{public: cashregister(); cashregister(double new_balance); void set_balance(double new_balance); double get_balance() const; private: double balance[12]; }; double get_monthly_balance(cashregister bk, int month); #endifwhich of the following is correct? a)the header file is correct as given. b)the definition of max_balance should be removed since header files should not contain constants. c)the definition of cashregister should be removed since header files should not contain class definitions. d)the body of the get_monthly_balance function should be added to the header file.

How do i take a screenshot on a laptop?