You are asked to develop C and Assembly programs separately that computes the square of a provided integer number N, i.e.., N. Algorithm: The number N should be multiplied by 2 as required. Then the program adds the lacking term to the previously multiplied part or subtracts the residual term from the previously multiplied part. For instance, program decides to add lacking term if there are less than or equal to k additions in the second part where ke N. Otherwise, program uses the subtraction of residual term process. This decision is important for a faster execution speed. Example: Let's consider N = 30 is given and the square of this number is asked to be found by using above algorithm. The decision number k = 8 in this example. or The program can compute the square of a given N in two different ways: (302222) + (30+30+...+30) 14x30 (302222 2) - (30+30). 2x30 (2) The program decides to use (2) since the second term requires only 2 k additions.