Consider s to be the set of all binary strings of length 2(n-1) that have exactly (n-1) os and (n-1) 1s. let p be the set of all shortest paths from start to goal as described in the previous question. provide a bijection between s and p. hint: the characterization of shortest paths will formulate this bijection

Question 9 of 10 2 points suppose your sat score is 1770. you look up the average sat scores for students admitted to your preferred colleges and find the list of scores below. based on your sat score of 1770, which average score below represents the college that would be your best option? o a. 1790 o b. 2130 o c. 2210 od. 1350