I need to b walked through some probs especially numbers and

t that was not correct.

ions, Cartesian coordinates, graphs, kinematics. Trigonometric functions Exponential and logarithmic functions Limits and differentiation Algebra, vector and matrices Combinatorics and Probability This task is divided in 3 stages. each stage will have its own milestone and will be released upon completion and review. Please just bid if you are available for all the tasks, check carefully the times. Complete a questionary with the math questions, approx. 7 pages every answer should be complete and extensive and fully explained in order to be fully understood the process. Approx. time 2 to 2.5 hours. Task 2 will take place on Monday, September 6, 2021 at: 1:00pm / 13:00 Coordinated Universal Time (UTC) This task will include a similar questionary with A B OR C Answers, approx time 1.5 hours to 2 hours, This questions will be provided one by one and requires that we connect by chat live. Task 3 will take place on Monday, September 6, 2021 at: 1:00pm / 13:00 Coordinated Universal Time (UTC) after task2 Upon completion of task 2 a document similar to task 1 will be provided in pdf, this one need to be completed within 4 hours after provided approx. 7 pages every answer should be complete and extensive and fully explained in order to be fully understood the process. For now I will provide task 1 document.

subgame perfect Nash equilibrium? Question 3: In which situations should we need the mixed extension of a game? Question 4: Find, if any, all Nash equilibria of the following famous matrix game: L R U (2,0) (3,3) D (3,4) (1,2) Question 5: What is the difference between a separating equilibrium and a pooling equilibrium in Bayesian games? Question 6: Give another name for, if it exists, the intersection of the players’ best-response « functions » in a game? Question 7: assuming we only deal with pure strategies, the Prisoner’s Dilemma is a situation with: No Nash equilibrium One sub-optimal Nash equilibrium One sub-optimal dominant profile No dominant profile Question 8: If it exists, a pure Nash equilibrium is always a profile of dominant strategies: True False Question 9: All games have at least one pure strategy Nash equilibrium: True False Question 10: If a tree game has a backward induction equilibrium then it must also be a Nash equilibrium of all of its subgames: Tr 2/2 Question 11: The mixed Nash equilibrium payoffs are always strictly smaller than the pure Nash equilibrium payoffs: True False Question 12: Which of the following statements about dominant/dominated strategies is/are true? I. A dominant strategy dominates a dominated strategy in 2x2 games. II. A dominated strategy must be dominated by a dominant strategy in all games. III. A profile of dominant strategies must be a pure strategy Nash equilibrium. IV. A dominated strategy must be dominated by a dominant strategy in 2x2 games. I, II and IV only I, II and III only II and III only I and IV only I, III and IV only I and II only Question 13: A pure strategy Nash equilibrium is a special case of a mixed strategy Nash equilibrium: True False Question 14: Consider the following 2x2 matrix game: L R U (3,2) (2,4) D (-1,4) (4,3) The number of pure and mixed Nash equilibria in the above game is: 0 1 2 3 Exercise (corresponding to questions 15 to 20 below): assume a medical doctor (M) prescribes either drug A or drug B to a patient (P), who complies (C) or not (NC) with each of this treatment. In case of compliance, controlled by an authority in charge of health services quality, the physician is rewarded at a level of 1 for drug A and 2 for drug B. In case of noncompliance, the physician is « punished » at -1 level for non-compliance of the patient with drug A and at -2 level for non-compliance with drug B. As for the compliant patient, drug A should give him back 2 years of life saved and drug B, only 1 year of life saved. When noncompliant with drug A, the same patient wins 3 years of life (due to avoiding unexpected allergic shock for instance), and when non-compliant with drug B, the patient loses 3 years of life. Question 15: You will draw the corresponding matrix of the simultaneous doctor-patient game. Question 16: Find, if any, the profile(s) of dominant strategies of this game. Question 17: Find, if any, the pure strategy Nash equilibrium/equilibria of this game. Question 18: Find, if any, the mixed strategy Nash equilibrium/equilibria of this game. Questions 19 and 20: Now the doctor prescribes first, then the patient complies or not: draw the corresponding extensive-form game (= question 19) AND find the subgame perfect Nash equilibrium/equilibria (=

inefficiencies, etc), and suggest an improved process. Open and read the Process Improvement (Final Q 1) document which describes the process steps in words and also includes a process map as a visual tool for understanding what's going on in each step. You will need to respond to the following three sub-questions: FINAL Q1: 3 Attachments are the Q1 ------------------------------------------------------------------------------------------------------------------------------------------------------------------ I need the 3 part question answered. This is everything in the question.. Understand that there is NOTHING INCOMPLETE, I have added everything that was sent to us. ------------------------------------------------------------------------------------------------------------------------------------------------------------------ a. Of the 9 process steps in the Process Improvement (Final Q 1) document, which specific steps in that process are experiencing lean wastes and/or process cycle time issues (please note, there is more than one step experiencing issues). In your response, name the process step, and/or the transfer interface between steps, and what waste(s) or cycle time issue is involved. Be sure to use standard lean/six sigma terminology that we used in the course when referring to any of the quality concepts; e.g., transportation waste when referring to situations involving a lot of moving around from one place to another. --------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- b. Which of the process steps you identified in part a do you believe could benefit from process improvement and why? --------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- c. What changes would you institute in the process to improve the steps you cited in part b of this question and describe how those changes improves the process. Be specific about which process step(s) your improving and thoroughly describe the improvement to that step. [Note: This question ties to what you decided was important in part b question above.] Also, when answering how you would improve a given process step, assume you have an unlimited budget and personnel resources and you can do mostly anything you want as long as it doesn't violate the laws of physics or the judicial system. Be cautious though because process improvement is designed to save time, money, and resources in doing the needed work.For example, automation is good, and also potentially expensive, so is it worth it for the improvement? - you will have to be the judge of that.

delines must follow. The purpose of this assignment is to give you practice using structs, using strings, writing functions and sorting. You will read a student file into an array of structs, determine grades, sort the array and print it out. Program Steps and Requirements Use the Student struct shown below. Read the input file (partially shown below) and store the data in an array of structs. The input file contains 55 student records and one heading line. Write code to determine the grade for each student. The grade determination is exactly as specified for this class in the syllabus. Remember to discard the lowest assignment grade. Sort the array of student students in descending order by the total points. Write the output file using the exact format shown below and include the two lines of headings in the output. Required Student struct and named constants const unsigned NumberOfStudents = 55; const unsigned PointsPossible = 400; const unsigned NumberOfAssignments = 10; const unsigned NumberOfExercises = 10; struct Student { int id; string name; int exercise[NumberOfExercises]; int assignment[NumberOfAssignments]; int midterm; int final; int codelab; int exerciseTotal; int assignmentTotal; int totalPoints; int percent; string grade; }; Input file -StudId- -------Name-------- -----Exercises----- ---------Assignments--------- Mi Fin CL 12345678 Smartiepants, Sam 5 4 5 4 5 5 5 5 5 5 20 19 20 20 20 20 19 20 20 19 65 98 9 18519268 Mendoza, Victor 4 2 5 4 1 4 5 5 5 4 17 12 17 18 14 17 19 18 14 18 59 49 6 23276929 Chien, Shengfeng 2 3 0 4 4 5 2 5 5 2 9 18 15 8 19 18 18 16 19 13 64 89 8 18242679 Dhaliwal, Shawn 5 5 3 4 5 4 2 4 4 5 9 18 17 15 18 19 12 15 18 14 45 92 9 09869966 Miraftab, Mina 5 3 5 5 3 5 4 0 4 3 17 4 3 18 12 16 14 17 17 12 52 68 7 10930997 Dimas, Abraham 5 3 4 5 4 3 4 3 3 3 12 18 20 11 14 7 15 10 18 15 64 89 6 11545560 Masongsong, Mikhael 1 3 5 4 3 4 5 3 5 5 19 19 9 13 17 20 20 14 14 19 64 96 8 10626377 Zigler, Joshua 4 3 4 3 2 5 4 4 4 5 17 14 18 20 17 18 12 19 14 14 51 90 5 ... Output report file Stud Id Name Ex Ass Mi Fin CL Tot Pct Gr -------- ------------------- -- --- -- --- -- --- --- -- 12345678 Smartiepants, Sam 48 178 65 98 9 398 100 A+ 11545560 Masongsong, Mikhael 38 155 64 96 8 361 90 A- 20767544 Martins, Gustavo 40 144 67 97 10 358 90 A- 23305464 Zumwalt, Jacob 37 160 62 90 8 357 89 B+ 23579439 Feirstein, Berent 42 159 55 91 9 356 89 B+ 14965959 Ho, Brandon 40 157 66 84 8 355 89 B+ 19988142 Wang, Lu 31 157 58 98 9 353 88 B+ 09559062 Mora, Gabriel 36 137 67 100 7 347 87 B 19108176 Bailey, Tanequa 44 152 56 85 8 345 86 B Suggested main function int main() { Student students[NumberOfStudents]; getStudentDataFromFile(students, InputFilename); determineGrades(students); sort(students); printStudentDataToFile(students,OutputFilename); }

formula online to help.. It should be a simple straightforward problem but i just can not for the life of me figure it out. are you able to provide me with a formula or point me in the right direction? The problem is: Solution A has a 50% concentration Solution B has a 100% concentration Solution C has a 5% concentration you have 5L of each solution to utilize as well as unlimited quantities of water to dilute solution concentrations if needed. Part A Make a final solution of 100ml with solution concentrations of Solution A 15%, solution C 5% and solution C 80%. how much of each solution will you need to make your final 100ml solution? Part B using the above solutions how many 100ml final solutions can you produce with the 5L volumes? No matter how I work it i can't make the solution to the correct concentrations. Thank you for your help. John

formula online to help.. It should be a simple straightforward problem but i just can not for the life of me figure it out. are you able to provide me with a formula or point me in the right direction? The problem is: Solution A has a 50% concentration Solution B has a 100% concentration Solution C has a 5% concentration you have 5L of each solution to utilize as well as unlimited quantities of water to dilute solution concentrations if needed. Part A Make a final solution of 100ml with solution concentrations of Solution A 15%, solution C 5% and solution C 80%. how much of each solution will you need to make your final 100ml solution? Part B using the above solutions how many 100ml final solutions can you produce with the 5L volumes? No matter how I work it i can't make the solution to the correct concentrations. Thank you for your help. John

achine B. The nature of the machines makes their cost functions differ. Total cost is given by ​C(x,y)equalsUpper C left parenthesis x right parenthesisplusUpper C left parenthesis y right parenthesis. How many units should be made on each machine in order to minimize total costs if xplusyequals19 comma 740 units are​ required? The minimum total cost is achieved when ___ units are produced on machine A and ___ units are produced on machine B

and B where m is an integer such that m is congruent to 1 modulo b have the same cardinality. I need help with the process of finding a function to define the two sets to determine the bijection.

In each row, we have some True, some false. I want to calculate the number of possibilities

unds of the chocolate for $32.50, while Company B is offering 2 3/4 pounds of the same chocolate for $35.00. Which company is offering the lowest price per pound?

onnect a line between every two consecutive points (xi, yi) and (xi+1, yi+1), where 0 <= i <= n. xi = s * ((a + b) * cos (i * PI) - b * cos ((a + b) / b * i * PI)) yi = s * ((a + b) * sin (i * PI) - b * sin ((a + b) / b * i * PI)) Verify with s = 10, a = 19, b = 5, n = 1000 to get this displayed result. Note that the sin and cos trigonometry functions accept a radiant value not angle. For example, 30 degree should be replaced with PI/180*30 instead. Moreover, the divisions inside the functions need to be kept in double not int precision in order to render a correct result.

et loans (he doesn't "earn" income). With the loans (L) he needs to decide between first period consumption (C1) and investment (I). The amount invested will allow him to get a second period income Y with probability P which is increasing in I (therefore, P(I)), In case of success and the person obtain Y, the individual should use Y to repay the loan (L) that he requested in the first period and consume in the second period (C2). However, with probability 1 - P(I), the person don't get Y and therefore only consume C1. Note that if the individual only invest the loan (L=I) and don't obtain Y, he can't consume anything. That motivates him not to invest the whole loan and keep part of the loan in order to warrant at least first period consumption. Therefore, considering B the parameter for the time preference, the problem would be: max U=ln(C1) + Bln(C2) s.t: L = I + C1 Y(I) = L(1+r) + C2 with Probability P(I) or s.t: L = I + C1 with probability 1 - P(I) My question is, Have you ever seen something like this? If yes, how to proceed? What is more important, I really need a bibliography (a book or article talking about this)