You are working on a problem where the size of each test case is between 1 and 100 integers and where the timeout is 4 seconds. You have developed a cubic time algorithm for the problem that gives the correct answer on all test cases. If you submit that solution, will you pass all test cases in time? Please answer YES or NO and then briefly explain your answer.

You are asked to determine the value of the decision parameter p used in Bresenham's circle drawing algorithm. The algorithm for drawing circles by Bresenham is presented in a series of instructions.

In matlab

Implement a program that requests four numbers from the user. Your program should compute the average of the first three numbers and compare the average to the fourth number. If they are equal, your program should print True

Start with a pile of n stones and successively split a pile into two smaller piles until each pile has only one Each time a split happens, multiply the number of stones in each of the two smaller piles. (For example, if a pile has 15 stones and you split it into a pile of 7 and another pile of 8 stones, multiply 7 and 8.)  The goal of this problem is to show that no matter how the  pile of n  stones are split, the sum of the products computed at each split is equal to n(n - 1)/2. Using strong mathematical induction, prove that no matter how the pile of n stones are split, the sum of the products computed at each split is equal to n(n - 1)/2.