Nine Point Six Bits

A Bloom filter guards an object store lookup. It is sized at $m = 96$ million bits (12 MB) for $n = 10$ million keys with $k = 7$ hash functions, so $m/n = 9.6$.

$f = \left(1 - e^{-kn/m}\right)^{k}$

The dataset later grows to 40 million keys with the same bit array and the same $k$. What is the false positive rate at 10 million keys, and at 40 million?