title: Minimum Spanning Tree of Max Cost Complexity Class Problem
body: <p><b>&quot;Decide whether a given undirected graph G=(V,E) with positive edge costs has a minimum spanning tree of cost at most K&quot;.</b>
  Is this a problem of <b>P, NP, CoNP, RP or BPP? </b></p>
  <p>I am fair sure that it is in NP, as there is a way to 'guess' and verify that guess in polynomial time.
  But I am thinking that it is in P as well, as well use the Prim Algorithm within polynomial time as well. <br><br>
  If it is in both P &amp; NP. Is it fair to say that it is in CoNP, RP &amp; BPP as well? As P is a subset of CoNP, whereas RP is a subset of NP, &amp; RP is also a subset of BPP. Is it fair to say that the problem above is in all of the 5 complexity classes - P, NP, CoNP, RP or BPP?<br> I am unsure if I misunderstood any of the concepts here. But please let me know if what I understand is correct. Thank you.</p>