Write a program in C++ that calls both a dynamically bound method and a statically bound method a large number of times, timing the calls to both of the two. Compare the timing results and compute the difference of the time required by the two. Explain the results.

Write a C++ program for the following. In each plastic container of Pez candy, the colors are stored in random order. Your little brother only likes the yellow ones, so he painstakingly takes out all of the candies, one at a time, eats the yellow ones, and keeps the others in order so he can return them to the container in exactly the same order as before, minus the yellow candies, of course. Write a program to simulate this process. You must use Nyhoff's stack class; other solutions including the use of the STL stack class are unacceptable. Assume that the candies are denoted as Y for yellow, B for blue, R for red, O for orange. Your program is to query the user for ten letters (representing ten Pez candies), and after using appropriate stack operations, display the contents of the container minus the yellow candies.  The order in which the letters are entered is the order that they were removed from the Pez container.  When your answer is displayed the results must be in the same…

Write this code in any language Python, Java or C++ and complete the code and make sure it runs.

Write a function in C++ that accepts a student’s final exam grade (worth 40 points) and number of completed projects (each worth 10 points) and returns the calculated final grade (out of 100 points) to the main method.