user: What is the c source code of the assembly code below:

```asm
<main>:
  endbr64
  push   %rbp
  mov    %rsp,%rbp
  sub    $0x20,%rsp
  mov    %fs:0x28,%rax
  mov    %rax,-0x8(%rbp)
  xor    %eax,%eax
  movq   $0x0,-0x10(%rbp)
  movq   $0x0,-0x18(%rbp)
  lea    D104(%rip),%rax
  mov    %rax,%rdi
  call   <printf@plt>
  lea    -0x20(%rbp),%rax
  mov    %rax,%rsi
  lea    D29(%rip),%rax
  mov    %rax,%rdi
  call   <scanf@plt>
  mov    -0x20(%rbp),%eax
  cltq
  shl    $0x2,%eax
  mov    %eax,%edi
  call   <malloc@plt>
  mov    %rax,-0x10(%rbp)
  lea    D63(%rip),%rax
  mov    %rax,%rdi
  call   <printf@plt>
  movl   $0x0,-0x1c(%rbp)
  jmp    L6
L22:
  mov    -0x1c(%rbp),%eax
  cltq
  lea    0x0(,%rax,4),%rdx
  mov    -0x10(%rbp),%rax
  add    %rdx,%rax
  mov    %rax,%rsi
  lea    D29(%rip),%rax
  mov    %rax,%rdi
  call   <scanf@plt>
  addl   $0x1,-0x1c(%rbp)
L6:
  mov    -0x20(%rbp),%eax
  cmp    %eax,-0x1c(%rbp)
  jl     L22
  lea    D5(%rip),%rax
  mov    %rax,%rdi
  call   <printf@plt>
  mov    -0x20(%rbp),%edx
  mov    -0x10(%rbp),%rax
  mov    %edx,%esi
  mov    %rax,%rdi
  call   <printIntArray@plt>
  mov    -0x20(%rbp),%edx
  mov    -0x10(%rbp),%rcx
  lea    -0x18(%rbp),%rax
  mov    %rcx,%rsi
  mov    %rax,%rdi
  call   <cloneIntArray@plt>
  lea    D100(%rip),%rax
  mov    %rax,%rdi
  call   <printf@plt>
  mov    -0x20(%rbp),%edx
  mov    -0x18(%rbp),%rax
  mov    %edx,%esi
  mov    %rax,%rdi
  call   <printIntArray@plt>
  mov    -0x20(%rbp),%edx
  mov    -0x18(%rbp),%rax
  mov    %edx,%esi
  mov    %rax,%rdi
  call   <IntArraySelSort@plt>
  lea    D95(%rip),%rax
  mov    %rax,%rdi
  call   <printf@plt>
  mov    -0x20(%rbp),%edx
  mov    -0x18(%rbp),%rax
  mov    %edx,%esi
  mov    %rax,%rdi
  call   <printIntArray@plt>
  mov    -0x18(%rbp),%rax
  mov    %rax,%rdi
  call   <free@plt>
  mov    -0x20(%rbp),%edx
  mov    -0x10(%rbp),%rcx
  lea    -0x18(%rbp),%rax
  mov    %rcx,%rsi
  mov    %rax,%rdi
  call   <cloneIntArray@plt>
  mov    -0x20(%rbp),%edx
  mov    -0x18(%rbp),%rax
  mov    %edx,%esi
  mov    %rax,%rdi
  call   <IntArrayInsSort@plt>
  lea    D20(%rip),%rax
  mov    %rax,%rdi
  call   <printf@plt>
  mov    -0x20(%rbp),%edx
  mov    -0x18(%rbp),%rax
  mov    %edx,%esi
  mov    %rax,%rdi
  call   <printIntArray@plt>
  mov    -0x18(%rbp),%rax
  mov    %rax,%rdi
  call   <free@plt>
  mov    -0x20(%rbp),%edx
  mov    -0x10(%rbp),%rcx
  lea    -0x18(%rbp),%rax
  mov    %rcx,%rsi
  mov    %rax,%rdi
  call   <cloneIntArray@plt>
  mov    -0x20(%rbp),%eax
  lea    -0x1(%rax),%edx
  mov    -0x18(%rbp),%rax
  mov    $0x0,%esi
  mov    %rax,%rdi
  call   <intArrayMergeSort@plt>
  lea    D35(%rip),%rax
  mov    %rax,%rdi
  call   <printf@plt>
  mov    -0x20(%rbp),%edx
  mov    -0x18(%rbp),%rax
  mov    %edx,%esi
  mov    %rax,%rdi
  call   <printIntArray@plt>
  mov    -0x18(%rbp),%rax
  mov    %rax,%rdi
  call   <free@plt>
  mov    -0x20(%rbp),%edx
  mov    -0x10(%rbp),%rcx
  lea    -0x18(%rbp),%rax
  mov    %rcx,%rsi
  mov    %rax,%rdi
  call   <cloneIntArray@plt>
  mov    $0x0,%edi
  call   <time@plt>
  mov    %eax,%edi
  call   <srand@plt>
  mov    -0x20(%rbp),%eax
  lea    -0x1(%rax),%edx
  mov    -0x18(%rbp),%rax
  mov    $0x0,%esi
  mov    %rax,%rdi
  call   <intArrayQuickSort@plt>
  lea    D12(%rip),%rax
  mov    %rax,%rdi
  call   <printf@plt>
  mov    -0x20(%rbp),%edx
  mov    -0x18(%rbp),%rax
  mov    %edx,%esi
  mov    %rax,%rdi
  call   <printIntArray@plt>
  mov    -0x18(%rbp),%rax
  mov    %rax,%rdi
  call   <free@plt>
  mov    -0x20(%rbp),%edx
  mov    -0x10(%rbp),%rcx
  lea    -0x18(%rbp),%rax
  mov    %rcx,%rsi
  mov    %rax,%rdi
  call   <cloneIntArray@plt>
  mov    -0x20(%rbp),%edx
  lea    -0x18(%rbp),%rax
  mov    %edx,%esi
  mov    %rax,%rdi
  call   <intArrayHeapSort@plt>
  lea    D44(%rip),%rax
  mov    %rax,%rdi
  call   <printf@plt>
  mov    -0x20(%rbp),%edx
  mov    -0x18(%rbp),%rax
  mov    %edx,%esi
  mov    %rax,%rdi
  call   <printIntArrayReverse@plt>
  mov    -0x18(%rbp),%rax
  mov    %rax,%rdi
  call   <free@plt>
  mov    $0x0,%eax
  mov    -0x8(%rbp),%rdx
  sub    %fs:0x28,%rdx
  je     L16
  call   <__stack_chk_fail@plt>
L16:
  leave
  ret
```

tool_calls: name: extract_symbolic_data
arguments: label: D104
type_guessed: string
name: extract_symbolic_data
arguments: label: D29
type_guessed: string
name: extract_symbolic_data
arguments: label: D63
type_guessed: string
name: extract_symbolic_data
arguments: label: D5
type_guessed: string
name: extract_symbolic_data
arguments: label: D100
type_guessed: string
name: extract_symbolic_data
arguments: label: D95
type_guessed: string
name: extract_symbolic_data
arguments: label: D20
type_guessed: string
name: extract_symbolic_data
arguments: label: D35
type_guessed: string
name: extract_symbolic_data
arguments: label: D12
type_guessed: string
name: extract_symbolic_data
arguments: label: D44
type_guessed: string

tool: D104: How many elements do you want store in the array? 

tool: D29: %d

tool: D63: Insert elements:


tool: D5: This is your array:


tool: D100: This is the temporary array that we're going to order:


tool: D95: This is the array ordered with selection sort:


tool: D20: This is the array ordered with insertion sort:


tool: D35: This is the array ordered with mergesort:


tool: D12: This is the array ordered with quicksort:


tool: D44: This is the array ordered with heapsort:


assistant: ```c
int main() {
  int *a = NULL, *temp = NULL, n, i;
  printf("How many elements do you want store in the array? ");
  scanf("%d", &n);
  a = (int *)malloc(sizeof(int) * n);
  printf("Insert elements:\n");
  for (i = 0; i < n; i++) {
    scanf("%d", &a[i]);
  }
  printf("This is your array:\n");
  printIntArray(a, n);
  cloneIntArray(&temp, a, n);
  printf("This is the temporary array that we're going to order:\n");
  printIntArray(temp, n);
  IntArraySelSort(temp, n);
  printf("This is the array ordered with selection sort:\n");
  printIntArray(temp, n);
  free(temp);
  cloneIntArray(&temp, a, n);
  IntArrayInsSort(temp, n);
  printf("This is the array ordered with insertion sort:\n");
  printIntArray(temp, n);
  free(temp);
  cloneIntArray(&temp, a, n);
  intArrayMergeSort(temp, 0, n - 1);
  printf("This is the array ordered with mergesort:\n");
  printIntArray(temp, n);
  free(temp);
  cloneIntArray(&temp, a, n);
  srand(time(NULL));
  intArrayQuickSort(temp, 0, n - 1);
  printf("This is the array ordered with quicksort:\n");
  printIntArray(temp, n);
  free(temp);
  cloneIntArray(&temp, a, n);
  intArrayHeapSort(&temp, n);
  printf("This is the array ordered with heapsort:\n");
  printIntArrayReverse(temp, n);
  free(temp);
  return 0;
}
```