Given array V of integers.

Need to answer query of two types:

1. Given L, R, A, B, need to count how many A ≤ j ≤ B are so that L ≤ V_j ≤ R

2. Given i and X, V_i = X

Someone told me that this is impossible task in O(log n).

Is this true? Can anyone prove me that or prove it being wrong?