Please explain how you get the answer

Your work should be readable as well as correct. 1. Big-Oh and Run Time Analysis: Describe the worst case running time of the following pseudocode functions in Big-Oh notation in terms of the variable n. O(n2), O(n log n). O(n log n). O(n). O(n2 log n), O(n), O(2), On 0(log n), 0(1). O(n'). O(nn) a. void sillint n) for (inti-0;j0) out.printin(iD j-j-2 b. void silly int n, int x, int y) i for (int k = n; k > 0; k..) if (x