hello sir , i just want the final answer i dont full answer, i promise to comment and like your solution, please answer all of the question because theres no time post the qusteions anathoer time and i dont want the full answer,only the last answer but please solve all of question ,thank u

i just want the final answer i dont full answer, i promise to comment and like your solution, please answer all of the question because theres no time post the qusteions anathoer time and i dont want the full answer,only the last answer but please solve all of question ,thank u

Question 1 The recurrence equation of D&C closest pair algorithm with comparison sorting of points is Not yet answered O a. Tn)=2T(n/2)+C Marked out of 1.00 O b. Tn)=2T(n/2)+n Flag question O c. T(n)=T(n/2)+n 0 d. T(n)= 2T(n/2)+nlogn Question 3 It generates each of combinatorial objects of the problem, selecting those that satisfy the constraints and finding a desired object Not yet answered Marked out of 1.00 O a. Divide and conquer P Flag question O b. Exhaustive Search O c. Transformation O d. Decrease and conquer Question 4 The next lexicographic of the statement "ampusoma" is Not yet answered O a. "amsamopu" Marked out of 1.00 O b. "amsupoma" Flag question O c. "ampamosu" O d. "amsaupom" Question 5 It is a technique that divides the problem size into approximately equal part and working on all of these parts Not yet answered Marked out of 1.00 O a. Transformation Flag question O b. Dec & C O c. BF O d. D&C Let the permutation is 3-121 4 then the next permutation is Question 6 Not yet answered Marked out of 1.00 a. 3-2-4 1- P Flag question O b. -2 3-1-4- O c.--2 3-1 4- O d. 2 3+1 -4