Question 7 (2 points) Consider Module 6 assignments. There are three homeworks for you to complete, ( w and while there are varying numbers of points for each assignment, they are all considered equally import; only the average of each assignment matters. Suppose that the first assignment is the most difficult, the second is the easiest, and the third is in the middle, and so the following outcomes are possible for you on each assignment: HW 1 HW 2 HW 3 100% 100% 100% 90% 95% 90% 80% 90% 80% 70% Suppose we draw and fill out a tree diagram for this multi-step experiment, placing scores from top to bottom (meaning, the first step's branches are 100%, 90%, 80%, and 70%, similar to how the data is sorted in Part 2 of the Lecture Videos for this module). What would be the average (not sum) of all three assignments' scores of the lowest/bottom-most branch (colored red in the image below)? Express your answer as an integer, but do NOT include the percent sign (%).Question 6 (2 points) Saved 8 9 Consider Module o assignments. There are three homeworks for you to complete, and while there are varying numbers of points for each assignment, they are all considered equally import; only the average of each assignment matters. Suppose 11 that the first assignment is the most difficult, the second is the easiest, and the third is in the middle, and so the following outcomes are possible for you on each assignment: HW 1 HW 2 HW 3 100% 100% 100% 90% 95% 90% 80% 90% 80% 70% Suppose we draw and fill out a tree diagram for this multi-step experiment, placing scores from top to bottom (meaning, the first step's branches are 100%, 90%, 80%, and 70%, similar to how the data is sorted in Part 2 of the Lecture Videos for this module). What would be the average (not sum) of all three assignments' scores of the highest/top-most branch (colored red in the image below)? Express your answer as an integer, but do NOT include the percent sign (%). 080860 600600 600 080800Question 5 (2 points) Consider Module 6 assignments. There are three homeworks for you to complete, and while there are varying numbers of points for each assignment, they are all considered equally import; only the average of each assignment matters. Suppose that the first assignment is the most difficult, the second is the easiest, and the third is in the middle, and so the following outcomes are possible for you on each assignment: HW 1 HW2 HW 3 100% 100% 100% 90% 95% 90% 80% 90% 80% 70% Suppose we draw and fill out a tree diagram for this multi-step experiment, placing scores from top to bottom (meaning, the first step's branches are 100%, 90%, 80%, and 70%, similar to how the data is sorted in Part 2 of the Lecture Videos for this module). What would be the sum of all three assignments' scores of the highest/top- most branch (colored red in the image below)? Express your answer as an integer, but do NOT include the percent sign (%)