A search algorithm on an array of size n runs in O$($lg n$)$ time. If $200,000$ searches on an array of size

$2^18$ takes $20$ ms$,$ how long will $540,000$ searches take on an array of size $2^20$ take, in milliseconds?