If you were to get these questions on a test and could not use a computer to answer this question, only pen and paper.

How would you answer them? Please explain in detail and with step-by-step on how to approach questions like these :)

An algorithm, that sorts a sequence of elements, can be illustrated as below: CH, B, G, A, E, F, C, DJ [B, H, G, A, E, F, C, DJ CB, G, H, A, E, F, C, DJ CA, B, G, H, E, F, C, D] CA, B, E, G, H, F, C, D] CA, B, E, F, G, H, C, D [A, B, C, E, F, G, H, DJ CA, B, C, D, E, F, G, H] CA, B, C, D, E, F, G, H] a Create a method sort that accepts an array of character strings, and sorts them according to the given algorithm. b) Let n denote the number of elements to be sorted. Determine in such a case the time complexity for the algorithm in terms of the number of comparisons -both the best case and the worst case. Categorize the corresponding complexity functions: to which o-set do they belong