Please consider the following function and determine the Big-O notation using recurrence relation. (10 pts.) int fun (int n) { if (n == 0 || n == 1) return n; if (n3 != 0) return 0; return fun (n/3)