6d:I[38030,["70161","$1e","88847","$1f","88834","$20","14399","$21","84313","$22","19254","$19","17558","$23","83253","$24","58059","$25","3196","$26","52567","$1a","80321","$27","80363","$28"],"default"] 64:null 65:["$","div",null,{"className":"mt-4","data-ssr-question-stem":true,"children":[["$","p","0",{"children":[["$","$1","0",{"children":[["$","$1","0",{"children":"Let "}]]}],["$","$1","1",{"children":["$","code",null,{"children":[["$","span","0",{"dangerouslySetInnerHTML":{"__html":"

G

"}}]]}]}],["$","$1","2",{"children":[["$","$1","0",{"children":" be a connected undirected graph of 100 vertices and 300 edges. The weight of a minimum spanning tree of "}]]}],["$","$1","3",{"children":["$","code",null,{"children":[["$","span","0",{"dangerouslySetInnerHTML":{"__html":"

G

"}}]]}]}],["$","$1","4",{"children":[["$","$1","0",{"children":" is 500. When the weight of each edge of "}]]}],["$","$1","5",{"children":["$","code",null,{"children":[["$","span","0",{"dangerouslySetInnerHTML":{"__html":"

G

"}}]]}]}],["$","$1","6",{"children":[["$","$1","0",{"children":" is increased by five, the weight of a minimum spanning tree becomes ________."}]]}]]}]]}] 66:["$","p",null,{"className":"mt-3 text-sm text-content-secondary","data-ssr-question-analytics":true,"children":["Attempted by ",201," students","","."]}] 67:["$","div",null,{"id":"locked-question-solution","className":"kg-paywalled-solution","data-ssr-solution-paywall":true,"children":[["$","p",null,{"children":"Sign up free to check your answer"}],["$","a",null,{"href":"/auth/login?redirect=%2Flearn%2FALGORITHMS%2Falgorithim%2Fminimum-spanning-trees%2Fmst-prims-algo%2Fpyq-questions%3Fq%3D68ecacc995474565f43efbca","className":"underline","children":"Sign up free"}]]}] 68:["$","nav",null,{"aria-label":"More questions in this collection","className":"mt-8","data-ssr-question-nav":true,"children":[["$","p",null,{"className":"text-sm text-content-secondary","children":["Question ",14," of ",31," ",["$","span",null,{"className":"inline-flex shrink-0 text-xs font-medium text-content-muted","children":"Q3484"}]," in"," ",["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/minimum-spanning-trees/mst-prims-algo/pyq-questions","className":"text-content-success hover:underline","children":"PYQ Questions"}],"."]}],["$","ul",null,{"className":"mt-2 flex list-none flex-wrap gap-x-4 gap-y-2 pl-0 text-sm","children":[["$","li",null,{"children":["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/minimum-spanning-trees/mst-prims-algo/pyq-questions?q=68ecaca795474565f43ef874","className":"text-content-success hover:underline","data-ssr-question-prev":true,"children":"← Previous question"}]}],["$","li",null,{"children":["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/minimum-spanning-trees/mst-prims-algo/pyq-questions?q=68ecacef95474565f43eff89","className":"text-content-success hover:underline","data-ssr-question-next":true,"children":"Next question →"}]}],[["$","li","68ecac2f95474565f43eef70",{"children":["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/minimum-spanning-trees/mst-prims-algo/pyq-questions?q=68ecac2f95474565f43eef70","className":"text-content-success hover:underline","children":["Question ",9]}]}],["$","li","68ecac7895474565f43ef484",{"children":["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/minimum-spanning-trees/mst-prims-algo/pyq-questions?q=68ecac7895474565f43ef484","className":"text-content-success hover:underline","children":["Question ",10]}]}],["$","li","68ecac7895474565f43ef48b",{"children":["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/minimum-spanning-trees/mst-prims-algo/pyq-questions?q=68ecac7895474565f43ef48b","className":"text-content-success hover:underline","children":["Question ",11]}]}],["$","li","68ecac9a95474565f43ef716",{"children":["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/minimum-spanning-trees/mst-prims-algo/pyq-questions?q=68ecac9a95474565f43ef716","className":"text-content-success hover:underline","children":["Question ",12]}]}],["$","li","68ecad1c95474565f43f03d6",{"children":["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/minimum-spanning-trees/mst-prims-algo/pyq-questions?q=68ecad1c95474565f43f03d6","className":"text-content-success hover:underline","children":["Question ",16]}]}],["$","li","68ecad3295474565f43f05f2",{"children":["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/minimum-spanning-trees/mst-prims-algo/pyq-questions?q=68ecad3295474565f43f05f2","className":"text-content-success hover:underline","children":["Question ",17]}]}],["$","li","68ecad3295474565f43f05f8",{"children":["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/minimum-spanning-trees/mst-prims-algo/pyq-questions?q=68ecad3295474565f43f05f8","className":"text-content-success hover:underline","children":["Question ",18]}]}],["$","li","68ff62f5f026506b12715b18",{"children":["$","a",null,{"href":"/learn/ALGORITHMS/algorithim/minimum-spanning-trees/mst-prims-algo/pyq-questions?q=68ff62f5f026506b12715b18","className":"text-content-success hover:underline","children":["Question ",19]}]}]]]}]]}] 69:["$","p",null,{"className":"mt-8","children":["$","$L63",null,{"href":"/courses/ALGORITHMS","className":"inline-block rounded-lg bg-surface-success-strong px-5 py-2.5 font-semibold text-content-inverse","data-ssr-enroll-cta":true,"children":["Explore the full course:"," ","Algorithms"]}]}] 6b:["$","div",null,{"data-learn-authed-skeleton":true,"className":"min-h-[var(--kg-design-utility-min-h-451bd10b)]","children":["$","$L6d",null,{"variant":"question"}]}]

Let \(G\) be a connected undirected graph of 100 vertices and 300 edges. The…