Which of the following is true of vertex-edge graphs? a.)they can model real-world problems. b.)they can all be solved. c.)euler paths are the same as hamilton paths. d.)all vertices must be used once in hamilton circuits. i didn't know this one, honestly i don't care at the moment. so me on this..

Stu and ambrose are working together on a study of whether diet is related to students' mental health. first, they randomly select 10 students from the student center and 10 students from the office of counseling and psychological services. then, they ask students to rate their diet in terms of healthiness on a scale of 1-100 before completing a 20-item mental health survey. a) name one of the constructs being studied b) how was the construct you named above operationally defined in this experiment? e) was the variable you described above their independent variable, their dependent variable, or a controlled variable? d) what is a confounding variable? what is a potential confound in this study?