urgent c programming please solve in one hour

> PT2.odr G Apps o YouTube M Email Maps Yandex.Mail PT2.pdf 4 / 7 (d) Suppose that all is an integer array of lengthn. Consider this incomplete C code: 1/ SUBSTITUTE LOOP FRAGMENT HERE 1 int tempat ali) -an-i-1]; a[n-i-1] - tempi ! Suppose that you substitute each loop fragment below into the rectangle above. For each loop fragment on the left, write the letter of the best-matching description from the right. You may use each letter once more than once, or not at all ) for (int i = 0; i