Prove that a set with n elements has n(n ? l)/2 subsets containing exactly two elements whenever n is an integer greater than or equal to 2.

Chpter 2 BOL 81 CLODamxreaismwhtmaroaevylinLosogyXml,em) SSESONaiudiuenwchaairusnesupnedeprrynaqd btvrmeelsAKAdmnao) DHDATONYTHI:neatngvspaaomfydgeadaohrecngvs pahdoygopOHiteyhssfaewrdcWaerreadasapou. HDOLS:ameuefwersusaomon,rangsbn.heaeiefpsno HadO.OeatoheopudonwtteHndeohriswhhOH. AI:abtnehteaehdoenosH)naotnAntmohdoenautne ptnadneeto,aoieyhgeddoensmlyaoo. BS:abtnehteaehdoyin(H)nouo,rneaacpsH+ray...