**I KNOW THE ANSWER IS O(N LOG N) I NEED THE CODE FOR THIS (JAVA)**

Computer Big O

int bar(int n) { int count = 0; for (int i = n; i > 0; i /= 2) { for (int j = 0; j < i; j++) { count += 1; } } return count; } 

Input Format

N, the input to the function, as shown:

10

Constraints

None

Output Format

Print One of the following on its own line :

• O(log n)
• O(n)
• O(n log n)
• O(n^2)
• O(n^3)
• O(2^n)
• O(n^n)

Given code to write solution:

import java.io.*; import java.util.*;

public class Solution {

public static void main(String[] args) { /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */ } }