Given the total cost of running an algorithm is , what is the smallest integer value of c and the smallest integer value of N that will work in proving this algorithm is O(log2 n) ?

Given the total cost of running an algorithm is , what is the smallest integer value of c and the smallest integer value of N that will work in proving this algorithm is O(log2 n) ?