(1)

(2)

After having done the hand calculation and pseudocode for a program that models inflating a spherical balloon, now implement the task in C++. Remember, first the balloon is inflated to have a certain diameter (which is provided as an input). Then you inflate the balloon so that the diameter grows by an inch, and display the amount the volume has grown. Repeat that step: grow the diameter by another inch and show the growth of the volume. Here is a typical program run: Diameter: 10 Increase: 173 Increase: 208 Match the formatting of the sample program run in your solution. balloon.cpp 123457891011#include#includeusingnamespacestd;usintmain()fconstdoublePI=3.14159265358979323846;return0;retirn In city street grids, intersections are often defined by two integers, counting the position of horizontal and vertical streets (sometimes called streets and avenues). Imagine traveling from position (h1,v1) to (h2,v2). How many blocks do you traverse? Even though there are many possible routes, the distance only depends on the differences h2h1 and v2v1. However, you need to take the absolute value because the differences might be negative. Complete the following program that prints the number of blocks traveled, given the origin and destination of the trip (which will change as your code is tested). distance.cpp