' chroma File Edit View History Bookmarks People Window Help D Paarsnn eTeItt G I 9 Secure https:.ilview.eboakplusmearsoncmgeamfebookrlauncheText.do?values=bookFDx'E1\"I923::platform::'l030::bookPegeNumhereinfrumloginpage::N::invokeTypa::lms::|aunch$tate::goToE... l :: Apps I] I NetfliIt 3 Paint Lorna Nazare... M Gmail {:2 PLNU came: at] ATITesu'ngl Nu D American Detahankl 6 Course Home Me... 1 cwrse Home PEARSON nBrer-ner h-ITH , , Print | Semn | Help | SIng Om r'Ir-t-T ed'lieh exams-ions mode rn mathematics FIGURE 7-36 pets-r tannenbaum 36. The 4 by 5 grid shown in Fig 7-37 represents a network of streets (4 blocks by 5 blocks) in a small subdivision. For landscaping purposes, it is necessary to get water to each of the corners by laying down a system of pipes along the streets. The cost of laying down the pipes is 5340.000 per mile, and each block of the grid is exactly half a mile long. Find the cost of the cheapest network of pipes connecting all the corners of the subdivision. Explain your answer. (Hint: First determine the number of blocks in the MST.) D Preface > EICHAPTER 1: The Mummies of Elamnns; The Paradoxes of Dermclacy 5 Cl CHAPTER 2: The Mam DY Pcmar; Vllslul'lin'l Vuljru b [3 CHAPTER 3: The MatrIBIraLizsulSllariru; Fair- Div'einn Game: 5 El CHAPTER 4- The Meihemtiee nrAppomnnmenI; Menu me Rum-is b [3 CHAPTER 5: The Matrlsrrlaux ereemng Around: EularFaths and Circuit: > [11 CHAPTER 6: The Hawaii: ulTuuring; TravalIru Salesman Problems 5 DCHAPTERT' The FIGURE 7-40 40. Find the MST of the network shown in Fig. 7-41 using Kruskal's algorithm. and give its weight. f 30:: HT 302%: I. 20114 ION $020'+DE 5 Iris}: share J)1503131535303)G MeIIhernetIeenrhIemme; The J CueIeraeI Cum-amt] , mammal?\" FIGURE 7 37 FIGURE 741 mm Disdla'lullru; (liming ma Cnbeal Path 5 DCHAPTER B: pepueunn nldh um\". r... I. % v mamezmrnnemmm Imnmmd Leasihlaem I PmaLyPoicy I Permissions I Support I Feedback GmrxalDIjII-mezm