Find the Big-notations for the following pseudocode snippets with regard to n. Note, you must show us how to find the upper bound and the lower bound or you will get zero points.

A.
for k=0; k for j=6; j // code block that takes a constant runtime
}
}

B.
k=1;
do {
for j=1; j // code block that takes a constant runtime
}
j = j * 2;
} until j >= n;