Repost. Last person did not fully solve this or show the steps. I want to understand how to find big omega, big o, and big theta in each of the following problems. Thank you in advance.

(20pts) For each of the code snippets below, first derive the time complexity using summation notation, then find the close form and finally express it using tight asymptotic (big-Oh, big Theta, big-Omega) notation. Assume constant overhead per iteration of a loop. Keep details of your calculation until the last step of expressing your solution using tight asymptotic notation. 1. a. sum0 for (i= 1; is n; i++) for ((n/2): sum++ 21: 3) b. for (i = 1;