An old computer program which computes the n^\text{th}n th n, start superscript, start text, t, h, end text, end superscript Fibonacci number takes 0.050.050, point, 05 microseconds (\mu \text{s})(μs)(, mu, start text, s, end text, )to compute the 1^\text{st}1 st 1, start superscript, start text, s, t, end text, end superscript number. After this, each number takes twice as long as the previous number to compute. A computer engineer designs a new program which takes 0.8 \, \mu \text{s}0.8μs0, point, 8, mu, start text, s, end text to compute the 1^\text{st}1 st 1, start superscript, start text, s, t, end text, end superscript Fibonacci number. After this, each number takes 0.6 \, \mu \text{s}0.6μs0, point, 6, mu, start text, s, end text longer than the previous number to compute. How much longer in microseconds does it take the old program to compute the 8^\text{th}8 th 8, start superscript, start text, t, h, end text, end superscript Fibonacci number compared to the new program?