you give n integer a_1 a_2 ldot a_n for real number t consider complete weighted graph n vertex K_nt weight edge vertex j equal w_ijt a_i cdot a_j t cdot a_i a_j let ft cost minimum span tree K_nt Determine ft bound output maximum value attain