Solve x + 17 = -51

Solve each formula for the specified variable.   2x + y = 9

A 72-year-old patient is admitted with pneumonia. The nurse notes a blood pressure of 82/48 mmHg, heart rate 126 bpm, respiratory rate 28/min, and cool, clammy skin. The patient’s urine output has dropped to 10 mL/hr. Which nursing action is the priority?

You are given pseudocode of the merge sort algorithm: mergeSort(int[] numbers, int start, int end){     if (start < end)  //base case is start = end and sorting an array of 1     {           middle = (start+end)/2;           mergeSort(numbers, start, middle);           mergeSort(numbers, middle+1, end);           merge(numbers, start, middle, end);      }} Merge Algorithm Access the first item from both sequences: start to middle is sequence_1 and middle+1 to end is sequence_2.while not finished with either sequence Compare the current items from the two sequences, copy the smaller current item to the output sequence and access the next item from the input sequence whose item was copied.Copy any remaining items from the first sequence to the output sequence.Copy any remaining items from the second sequence to the output sequence.override the values in the output sequence to the original sequence provided as input. If we have an array of size n that is used as input to the mergeSort() function,  What should be the values for the start and end parameters for the initial call to mergeSort()? Assume array is 0 indexed and state your answers in terms of size, n. start: [start] end: [end] What is the time complexity of a single merge() operation in the worst case in terms of Big O notation? State your answers in terms of size, n. e.g. [merge] The maximum number of stack frames for the mergeSort() at any given point of time in terms of Big O notation will be: [calls] State your answers in terms of size, n. e.g. If the call to merge function is merge([5, 2, 1, 6], 0, 0, 1), then the value of numbers vector at the end of this call will be [end_val]. State your answer in terms of four numbers separated by spaces, e.g. 1 2 6 7  If mergeSort is called with the following parameters: mergeSort([ 1 ], 0, 0), how many times will the merge() function be called recursively: [merge_call]

Which statement about iteration order is true?

In a heap implemented with an array, an item at index 12 has its left child at index [leftchild] and its right child at index [rightchild] and its parent is at index [parent]. Give your answer in terms of i.  No spaces.  The index of the root of the heap is 0.  The floor function should be denoted with the word floor and parentheses, e.g. floor(x).

You are given a Graph represented as an adjacency list using the following container: unordered map adj_list.  The vertex labels are integers and the key of the map stores vertices and the vector of integers store the neighbors of that vertex. Your goal is to write a function in C++ called sum_of_levels() that take in as input the following three parameters: this Graph represented as an adjacency list called graph; a source vertex called source; and  an integer called level, which refers to the distance from source node to it’s neighbor. level > 0 This function must return the sum of all the vertices within the specified level.   Example for Graph, G below;  Alt Text for this Graph’s Adjacency List representation: Vertex: Neighbors of Vertex (Edges pointing from a vertex to the neighbor)0: 1, 21: 32: 43: 54: -5: 4Input: Graph G, Source 0, level 1Output: 3 (Sum of 1 + 2) Input: Graph G, Source 0, level 2Output: 7 (Sum of 3 + 4)Input: Graph G, Source 0, level 3Output: 5 (Sum of 5)Input: Graph G, Source 4, level 1Output: 0 (No neighbors of 4 at a distance of 1)You can use the following compilers to test your code: 1. https://cpp.sh/2. https://my.newtonschool.co/playgrounds/cpp-compiler3. https://www.w3schools.com/cpp/trycpp.asp?filename=demo_compiler

Which solutions from the list will have an acidic pH?

A scientist measures out the following volume of stock hydrochloric acid with a concentration of 10.5 M (the volume of the stock added is shown in the figure of the graduated cylinder below with the arrow pointing to the bottom of the meniscus). The solution is diluted to a final volume of 250.0 mL, what is the final concentration of the diluted solution.   

Below is an image of a coffee cup calorimeter with 97.5 g or water.  The temperature of water is measured before and after the addition of an 20.0 g of unknown metal.  How much energy is gained or lost by the water.  The specific heat of water is s = 4.184 .