Q$2[50].$ Deep dive into logically cutting corners in a solution through analysis. Find a solution to this

problem that executes in under $1$ second $($can it be even faster?$)$ without hardcoding the

answer. Displaying values takes a long time so remove most output statements once you$$re getting

close. I'll spare you the long version of the question. Simply do this: find the price of four items who's

sum and who's product both equal $7\mathrm{.}11.$ So$,$ a$+$b$+$c$+$d $==$ a$*$b$*$c$*$d $==7\mathrm{.}11.$ There may be more than

one answer. I originally solved this problem $42$ years ago $($in C$).$ My initial algorithm ran for over $12$

hours. My deep dive analysis produced one that solved it in about $1$ second. Supply your final

algorithm and how long it takes to solve the problem $($using the average of three runs$).$