Provide best-case and and the worst-case running time in big O notation for the following methods

public void b(int N) {

int sum = 0;

for (int i = 1; i < N; i *= 2) {

for (int j = 0; j < i; j++) {

sum++; } } }