问题4：这是随机算法分析新指标？ For every randomized algorithm A we consider a new complexity measure- the number of random bits used.Let RandomA(x)be the maximum number of random bits used over all random runs (computations)of A on x.Then, for every n∈N, RandomA(n)=max {RandomA(x)x is an input of size n}. 随机算法A的computations的个数将会是2 RandomA(n)问题4：这是随机算法分析新指标？ 随机算法A的computations的个数将会是