A CPU scheduler employs MLFQ algorithm, and total $7$ priroity levels are established. The topmost level $1$ queue is set with time quantum of $5$ms$,$ and time quantum for each of the other levels increments by $5$ms$.$ A new process arrives and is placed into level $1$ queue, when it compeltes, it was from level $5.$ Assuming this process is compeltely CPU$-$bound, which value is close to the virtual runtime length of this process?

a$.$

$20-25$ms

b$.$

$70-75$ms

c$.$

$>75$ms

d$.$

$<35$ms