WPC %)3,Zl 3P 3h4!RE(3=KR" ?SwmMa1 ԼaXsΧ;w o>ޜGh%.Dv'3Z2FCRDLk5X19 ΐa Kr&2* DٙA3:.- ~*7S[Y$'e|ae>X,\'|!p}`,OG^J'*{RE%,5"U-}[\!!M6w3n 5$1jvU;Ee/B\GRyGMXht[󣳮: m7H4 f7EΚάj;_QC9Z SO%ۡ 4H/S69gq?jgK~*+H4mßsy5S  ĮSdaFh7)b#\UN% %s 0:y 0U 0 0 0 0] 0 0 0d 0 0 0_ 0* 0 0~ 0 0 0O 0 0e 0! 0 0 07 0 0m 0 0^ faw145IX mZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZ Bqqqqqqqqqqq D-HP Color LaserJet 2600n0(9 Z6Times New Roman RegularX($USUS.,*+ (_2623  ..*D+D (_25   ," <DL,23  ..," <DL,   *5+5 (_24  ) <DL)23  ..) <DL)  *2+2 (_23 ` &<<DL&23  ..&<<DL& ` */+/ (_22  #DL#23  ..#DL#  *,+, (_21   DL 23  .. DL  *)+) (_20 h DDL23  ..DDL h *&+& (_19  L23  ..L  *#+# (_18   L23  .. L  *>> (_17  2( 4 <DL223  Ԁ2( 4 <DL2  *DD (_16   ," <DL,23  Ԁ," <DL,   *55 (_15  ) <DL)23  Ԁ) <DL)  *22 (_14 ` &<<DL&23  Ԁ&<<DL& ` *// (_13  #DL#23  Ԁ#DL#  *,, (_12   DL 23  Ԁ DL  *)) (_11 h DDL23  ԀDDL h *&& (_10  L23  ԀL  (## &_9   L23  Ԁ L  (>> &_8  2( 4 <DL223  2( 4 <DL2  (DD &_7   ," <DL,23  ," <DL,   (55 &_6  ) <DL)23  ) <DL)  (22 &_5 ` &<<DL&23  &<<DL& ` (// &_4  #DL#23  #DL#  (,, &_3   DL 23   DL  ()) &_2 h DDL23  DDL h (&& &_1  L23  L  &## $_   L23   L  8A5 TABLE Ar 5:i+003|xU d)!dxdx !USUS.,  _HHH9 XX@&Math203 9 @h h HamiltonianCircuitworksheet#X@Xx#  ]$ Supposeyouwishtoplanatrip,startinginLincoln,visitingBlair,Fremont,Hastings m4 andLexingtoninsomeorder,andthenreturningtoLincoln.Thefollowingisatable Y  ofdistancesbetweenthesecities: E  *!aV"ddd Xdd Xdd XH$H$,dd,dd,dd,dd,dd+        H Fremont   H  Hastings   H  Lexington   H  Lincoln   H  Blair 5+     8@248@524 4*(   8@24 8@ 4159    211    66    Fremont   H     H  137   H  190   H  53   H  Hastings            89    101    Lexington  H    H    H   6, H  d@166d@6_166_9/-H  d@166  d@ 9A.0  Draw(neatly)acompletegraphwiththefivecitiesatthevertices,andlabeleachedgewiththe P! distancebetweenthetwocities.u<"$$ B.0  Howmanydifferenttrips(circuits)arethere(startingandfinishinginLincoln)?Explain.q8/$$ C.0  UsethenearestneighboralgorithmstartingatLincolnandthecheapestlinkalgorithmtofind $!5 Hamiltoniancircuitsforyourtrip.%"6$$ D.0  Doesrepetitivenearestneighborprovideabetterresultthannearestneighborinthiscase?