Write the following program: Use struct data type to store information about a neighborhood. Every house in the neighborhood is characterized by the following information: 1) Street name (string up to 20 characters); 2) the number of the house as used in the address (integer); 3) Listed price (float); and 4) the number of months since the house was purchased by the current owner (integer). The information about the individual houses is read from an input file. Store the information about all houses in an array, and then display the content of the array. Order the houses in the decreasing order of their listed prices, and then display the houses in this order. A house is more likely to be sold if it has a lower listed price and also a higher number of years since it was purchased by the current owner. The formula describing the likelihood of a house to be sold is the following: Likelihood = 0.5 x 1/ Listed price (in tens of thousands) + 0.5 x number of months since purchase. Order the houses in decreasing order of their likelihood of being sold by the current owner. Assume that a buyer has $Y dollars for purchasing houses in the neighborhood. Devise an algorithm, so that the buyer focuses on purchasing the houses that are most likely to be sold, and which he can buy with the $Y dollars that he has. Your program should list the identified houses. Note: Extra credit is given if dynamic data structures are used.