You start from the top floor. At each step, you can go either diagonally down to the left or diagonally down to the right. This way you can form a route from the top of the pyramid to its base. Note that there are multiple routes that end somewhere in the base of the pyramid. Your goal is to maximize the sum of the integers on any route. Design and analyze an efficient algorithm to compute the maximum sum on any route from the top to the base of the pyramid.

In a study of the relationship between socio-economic class and unethical behavior, 129 university of california undergraduates at berkeley were asked to identify themselves as having low or high social-class by comparing themselves to others with the most (least) money, most (least) education, and most (least) respected jobs. they were also presented with a jar of individually wrapped candies and informed that the candies were for children in a nearby laboratory, but that they could take some if they wanted. after completing some unrelated tasks, participants reported the number of candies they had taken. it was found that those who were identiď¬ed as upper-class took more candy than others. in this study, identify: (a) the cases, (b) the variables and their types, (c) the main research question, (d) identify the population of interest and the sample in this study, and (e) comment on whether or not the results of the study can be generalized to the population, and if the ď¬ndings of the study can be used to establish causal relationships.