Z Tower stands near the city of XYJ. We require: a person who has been on top of the tower 5 minutes, must go down; while it's coming down, people
those at the bottom of the tower must wait. Climbing the stairs of the tower and descending
the stairs of the tower take one minute each. Every moment on the stairs
there can only be one person.
Now there is no one at the top of the tower, at the foot of the tower there is a person in line.
After T minutes, B more people will come. After what time (minutes) all people
come out of the tower (the last person to go down the stairs)

Describe in pseudocode an algorithm that given an integer n and a linked list of elements increases the linked list by a factor of n by replacing each element in the original list with n copies of that element. for example, if l: [18, 7, 4, 24, 11] and n = 3 the resulting list should be l: [18, 18, 18, 7, 7, 7, 4, 4, 4, 24, 24, 24, 11, 11, 11]. if the value of n is less than or equal to 0, the list should be empty after the call. what’s the running time of your algorithm?

Which option marks all modification made within a document? review comment track changes balloons

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.