For every randomized algorithm A we consider a new complexity measure- the number of random bits used.Let RandomA()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 is an input of size n}. 问题6： 这是什么意忠？为什么品要这个定义？