in c++

(UG-Bonus, G-30 Points) Programming Question A way of finding an approximation to n is to use numerical integration such as: T = 140 4.0 -dx (1 + x2) Approximate t using the integral given above as a sum of rectangles. Try at different numbers of threads and numbers of samples and compare the results (use a timer). Draw a table that shows the number of samples vs the approximation. Submit your code, and snapshots of all the results. (UG-Bonus, G-30 Points) Programming Question A way of finding an approximation to n is to use numerical integration such as: T = 140 4.0 -dx (1 + x2) Approximate t using the integral given above as a sum of rectangles. Try at different numbers of threads and numbers of samples and compare the results (use a timer). Draw a table that shows the number of samples vs the approximation. Submit your code, and snapshots of all the results