Please Show the work to how the upper bound was found

For each of the following code fragments, your task is to estimate its running time, in terms of n. You should assume that the value of n is defined elsewhere in the program. The running time that you report should be the tightest upper bound you can find. Don't just say everything is O(2t), because although correct, it is not precise enough. Upper bounds that are too big will receive deductions during grading. For each code sample: 1. State an upper bound on the running time of the program fragment using O() notation. 2. Briefly justify your upper bound. For each of the following code fragments, your task is to estimate its running time, in terms of n. You should assume that the value of n is defined elsewhere in the program. The running time that you report should be the tightest upper bound you can find. Don't just say everything is O(2t), because although correct, it is not precise enough. Upper bounds that are too big will receive deductions during grading. For each code sample: 1. State an upper bound on the running time of the program fragment using O() notation. 2. Briefly justify your upper bound