Miller Rabin algorithm

[iosystem]

Hi

I have 2 questions regrading the above algorithm:

How many numbers of 1000 bits are indeed prime?
(it should be about 1/X of the numbers. what is X?)

What is the average number of witnesses the algorithm
would examine in order to find a prime number of
1000 bits ?

thanks!