You are in a pumpkin patch looking for the great pumpkin. Each input record contains the weight of one pumpkin. You are to find the largest weight and the average weight of all of the pumpkins. You are to output each weight, as well as the largest weight and the average weight. Design the algorithm using both a header record logic approach and trailer record logic approach. ( Use a dummy record with a negative pumpkin weight to denote the end-of-file). (make sure to give me the answers with the Structure Chart and the right pseudocode with the indent)