Q1: Analyze the following Algorithms. Find their running time and asymptotic notations. int fun(int n) { Algorithm 1 int count = 0; ; for (int i = 0; i < n; i++) { for (int j = i; j> 0; j--) { count = count + 1; } } return count; void fun(int n, int arr[]) { int i = 0, j = 0; for(; i < n; ++i) { while(j int fun1 (int n) { if (n