These questions are from Data Structures. Please answer each part of the question in details as to why each of the answer correct and why the other options are wrong. Please provide details. For sufficient answer quality, I'd give a thumbs up and otherwise if the answer is short and not understood. Please explain as if you are explain the concept to a kid. Please answer all parts of the questions shown.

Please decide the O() for recursive relations below (All the initial T(k ) with small k are 1) T(n)=T(n2)+n T(n)=T(n30)+15 T(n)=2T(n/3)+n