1. The following C program named sort.c is a program that can sort an array of values in ascending order. However, some parts of the code (highlighted in yellow color below) are missing.

1. (1)___________
3. // swap the value between input a and b
4. void swap(int *a, int *b)
5. {
6. int temp = (2)__________;
7. *a = *b;
8. *b = temp;
9. }
11. // sort the input values in order from smallest to largest
12. void sort(int values[], int n)
13. {
14. int i;
15. for (i = 0; (3)________; i++)
16. {
17. (4)____________;
18. for (j = 0; j< n-i-j; (5)___________)
19. {
20. int *a = &values[j];
21. int *b = &values[j + 1];
22. if ((6)___________)
23. {
24. swap(a, b);
25. }
26. }
27. }
28. }
30. // display the input array of values in a line
31. void print_array((7)________________)
32. {
33. int i;
34. for((8)_________; i < n; i++)
35. {
36. printf((9)___________, values[i]);
37. }
38. printf(" ");
39. }
41. // main function to execute
42. (10)_______ main ()
43. {
44. int values[] = {5, 3, 6, 4, 2, 1};
45. int n = sizeof(values) / sizeof(values[0]);
46. printf("Before sorting: ");
47. (11)________________
48. (12)________________ // sort the values
49. printf("After sorting: ");
50. print_array(values, n);
51. }

The following figure shows an example of the results when running the complete version of the above C program:

Please read and try to understand the program code, then fill in the missing blankets with appropriate short statements to make the program work correctly.