There are N trees in a plantation. Each tree is assigned an information card which notes the following information: location (x, y), type (coffee or tea). The plantation manager wants to construct a fence around the plantation. For minimum cost, the fence length needs to be as short as possible. The manager also wants to build a watering system based on tubes to let water runs from the pump to each tree. The location of the pump needs to be considered to minimize the total length of the used tubes. Write C program that can help the manager to do the aboveLet the program input and output through file. Structure of file NongTrai.in – First line: N (number of trees). – The following N lines, line #i (0 <= i <= N - 1): Xi Yi Li (Xi Yi: location of tree #i, Li : type of tree #i (0-coffee, 1-tea). Structure of file NongTrai.out: - Line #1: S0 S1 (S0: coffee tree count, S1: tea tree count). - Line #2: Cmin (shortest fence length). - Line #3: Dmin (minimum total length of used tubes).
Freebies just for you
We are available 24/7
We help you complete college assignments in under 24 hours.
Get help with essays, research papers, PowerPoint Presentations, reports, reviews, and projects at incredibly low prices.
Trees in a plantation.
We will write a custom paper for you at $15.50 $11/page
Free title page
Free reference page
EssayTab is hands down the best essay writing service for college students. I was initially skeptical about the quality of a product that has such a low price point but I can tell you that it’s worth every penny! I’ve been using EssayTab for my essays in college as well as in grad school, and they always deliver excellent content.