You conducted a norovirus decay experiment and obtained norovirus concentrations (c) with time (t) as follows. If you are making a graph to see if this decay follows a second order kinetics model, what should be your x-axis and y-axis? Use the information provided in the previous questions. 

If you are growing bacteria in a batch reactor and want to know bacteria concentration with time. What assumptions can you make for mass balance? Choose all that apply.

In natural water bodies, which of the following are used to calculate ? Choose all that apply.

What is the name of the raccoon roundworm? 

If you plan to remove copper ions from acid mine drainage by precipitating them as copper oxide and copper hydroxide minerals through the addition of NaOH, at what pH between 6 and 12 will you observe the lowest copper ion concentration?  

Assume you did another experiment for alkalinity. Everything about the experimental plan (titrant concentration) and results (titrant amount) were the same, except for initial pH (initial pH of the water sample was 6.6). Compare the alkalinity of this water to that from the previous question.  

Based on the norovirus data provided in the previous question, which of the following kinetics model describes the norovirus decay the best? Draw a plot by hand using the given data if that helps. 

What is the time complexity of function_caller() in the worst case in terms of Big O notation? You can assume p and m are large values and greater than 0. void function_callee(int p, int m){ while(m > 1) { for(int i = 1; i < m; i++) { p = p * 2; } m = m / 2; }}void function_caller(int p, int m){        for(int i = 1; i < m; i++) {         function_callee(p, m); }}

Min Heap Deletion Write pseudocode or C++ code describing a function that returns the smallest value in a binary Min Heap (min() operation). Include the function header (return type, method name, parameters) . Describe how deletion works in a min heap . Write pseudocode or C++ code describing a function that deletes a node from a binary Min Heap (extractMin). Include the function header (return type, method name, parameters) . State the worst case time complexity for your min() and extraMin() function .    You can assume the following if needed: It is a 0-indexed integer Min Heap The Min Heap array and its size is passed into this function. The array is already large enough to store another node; i.e. it does not need to be resized.

What is the dominant species of nitrogen at pH 8 and pe 1?