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. 0(n2), 0( log n). O(n log n). O(n) 0(n-log n). 0(n))0(2), O(n*), 0(log n), 0(1). O(n4). O(r) a. void silly(int n) for (int i = 0; i 0) d System.out.printlnj+j) j-j-2