For i=1 to 2

    For j=1 to 5-i

      If a(j+1)<a(j)Then t=a(j)：a(j)=a(j+1)：a(j+1)=t

    Next j

  Next i

        小张经分析，每次n堆金币如果都是从小到大，将前两堆合并成新一堆，然后，继续进行从小到大排序，如此合并成最后一堆，此时消耗体力最少，为此他编写了一个解决上述问题，求最少体力的VB程序，功能如下：窗体加载时，自动读取n堆金币的数据，依次存储在数组元素a(1)、a(2)、a(3)…中，金币堆数存储在变量n中，n堆金币的重量数据显示在列表框List1中。单击“求解”按钮Command1，程序对n堆金币进行合并处理，消耗最少的体力显示在文本框Text1中。程序运行界面如图所示。

Dim a(8) As Integer For i = 2 To 8

           a(0) = a(i)

           Do While a(0) < a(j)  

                  j = j - 1

           Loop

       Next i

数组元素 a(1)~a(8)的值为随机生成的整数，为实现升序排序，则上述程序段3个方框处的表达式分别为（  ）

For i=1 To ①    

  k=i

  For j=i+1 To n-i+1

If a(k)>a(j) Then k= ②    

  Next j

  If k<>i Then t=a(k):a(k)=a(i):a(i)=t For j= ③      

    If a(j)<a(j+1) Then a(j)=a(j)+a(j+1) : a(j+1)=a(j)-a(j+1):a(j)=a(j)-a(j+1) Next j

Next i

上述程序段3个划线处的表达式分别为（  ）

Private Sub Command1_Click()

Dim a(1 To 6) As Integer, b(1 To 6) As String, i as integer, j as integer

Dim c As String, k As Integer, tmp1 As Integer, tmp2 As String

s=text1.text

i = 1: k = 1: tmp1 = 0: tmp2 = ""

Do While i <= Len(s)

      c = Mid(s, i, 1)

      If c = "," Then

         a(k) = tmp1: b(k) = tmp2

         tmp1 = 0: tmp2 = ""

              ①    

      Else

        If  Then 

           tmp2 = tmp2 + c

        Else

         tmp1=tmp1*10+val(c)

        End If

      End If

      i = i + 1

    Loop

    For i = 1 To 5

      For j = 1 To 6 - i

        If a(j) > a(j + 1) Then tmp1 = a(j): a(j) = a(j + 1): a(j + 1) = tmp1

    If Len(b(j)) > Len(b(j + 1)) Or      ②       Then

          tmp2 = b(j): b(j) = b(j + 1): b(j + 1) = tmp2

        End If

      Next j

    Next i

    For i = 1 To 6

      List1.AddItem Str(a(i)) + b(i)

    Next i

    End Sub

For i= 1 To 2

    For j=5 To i+1 Step-1

      If a(j) >a(i) Then

        t=a(j)：a(j)=a(i)：a(i)=t

      End If

    Next j

Next i

数组元素a(1)到a(5)的值依次为“33，24，45，16，77”，经过该程序段“加工”后，数组元素a(1)到a(5)的值依次为（  ）