what is the best data structure to solve the following problem? a list needs to be built dynamically. data must be easy to find, preferably in o(1). the user does not care about any order statistics such as finding max or min or median.

The solutions to the inequality y ≤ 2x − 4 are shaded on the graph. which point is a solution? p

Rick is on a bicycle trip. every 4 days he bikes 230 km. if rick keeps this same pace for 16 days, how many kilometers will he bike?

Mr. chiu made a dot plot after asking his students a question. based on the dot plot, which statements are correct? check all that apply. eleven students answered mr. chiu's question. twelve students answered mr. chiu's question. three people studied for two hours. three people studied for three hours. everyone who responded studied for at least one hour. four people studied for four or more hours