user: What would the C source look like for the assembly code provided here:

```asm
<main>:
  endbr64
  push   %r15
  push   %r14
  push   %r13
  lea    D75(%rip),%r13
  push   %r12
  lea    D10(%rip),%r12
  push   %rbp
  push   %rbx
  lea    D39(%rip),%rbx
  sub    $0xf8,%rsp
  mov    %fs:0x28,%rax
  mov    %rax,0xe8(%rsp)
  xor    %eax,%eax
  lea    0x1c(%rsp),%rbp
  jmp    L85
  nopl   0x0(%rax)
L140:
  cmp    $0x2,%eax
  jne    L73
  mov    0x18(%rsp),%eax
  lea    0x20(%rsp),%r8
  xor    %esi,%esi
  mov    %r8,%rdi
  mov    %r8,0x8(%rsp)
  lea    -0x1(%rax),%edx
  call   <quickSort@plt>
L125:
  lea    D2(%rip),%rdi
  call   <printf@plt>
  mov    0x18(%rsp),%esi
  mov    0x8(%rsp),%rdi
  call   <printArray@plt>
L8:
  xor    %eax,%eax
  call   <getch@plt>
  cmpl   $0x4,0x1c(%rsp)
  je     L123
L85:
  mov    %r13,%rdi
  call   <system@plt>
  mov    %r12,%rdi
  call   <printf@plt>
  mov    %rbp,%rsi
  mov    %rbx,%rdi
  call   <scanf@plt>
  mov    0x1c(%rsp),%eax
  lea    -0x1(%rax),%edx
  cmp    $0x2,%edx
  jbe    L11
L60:
  cmp    $0x3,%eax
  jg     L144
  cmp    $0x1,%eax
  jne    L140
  mov    0x18(%rsp),%eax
  lea    0x20(%rsp),%r8
  xor    %esi,%esi
  mov    %r8,%rdi
  mov    %r8,0x8(%rsp)
  lea    -0x1(%rax),%edx
  call   <mergeSort@plt>
  jmp    L125
  nopw   0x0(%rax,%rax,1)
L144:
  cmp    $0x4,%eax
  jne    L73
  lea    D68(%rip),%rdi
  call   <printf@plt>
  xor    %eax,%eax
  call   <getch@plt>
  cmpl   $0x4,0x1c(%rsp)
  jne    L85
  nop
L123:
  mov    0xe8(%rsp),%rax
  sub    %fs:0x28,%rax
  jne    L103
  add    $0xf8,%rsp
  xor    %eax,%eax
  pop    %rbx
  pop    %rbp
  pop    %r12
  pop    %r13
  pop    %r14
  pop    %r15
  ret
  nopl   0x0(%rax,%rax,1)
L73:
  lea    D77(%rip),%rdi
  call   <printf@plt>
  jmp    L8
  nopl   0x0(%rax)
L11:
  lea    D12(%rip),%rdi
  lea    0x20(%rsp),%r14
  xor    %r15d,%r15d
  call   <printf@plt>
  lea    0x18(%rsp),%rsi
  mov    %rbx,%rdi
  call   <scanf@plt>
  lea    D14(%rip),%rdi
  call   <printf@plt>
  mov    0x18(%rsp),%eax
  test   %eax,%eax
  jle    L70
  nopl   (%rax)
L135:
  mov    %r14,%rsi
  mov    %rbx,%rdi
  add    $0x1,%r15d
  add    $0x4,%r14
  call   <scanf@plt>
  cmp    %r15d,0x18(%rsp)
  jg     L135
L70:
  mov    0x1c(%rsp),%eax
  cmp    $0x3,%eax
  jne    L60
  mov    0x18(%rsp),%eax
  lea    0x20(%rsp),%r8
  mov    %r8,%rdi
  mov    %r8,0x8(%rsp)
  lea    -0x1(%rax),%esi
  call   <heapSort@plt>
  jmp    L125
L103:
  call   <__stack_chk_fail@plt>
```

tool_calls: name: retrieve_data
arguments: data_label: D75
type_infered: string
name: retrieve_data
arguments: data_label: D10
type_infered: string
name: retrieve_data
arguments: data_label: D39
type_infered: string
name: retrieve_data
arguments: data_label: D2
type_infered: string
name: retrieve_data
arguments: data_label: D68
type_infered: string
name: retrieve_data
arguments: data_label: D77
type_infered: string
name: retrieve_data
arguments: data_label: D12
type_infered: string
name: retrieve_data
arguments: data_label: D14
type_infered: string

tool: D75: cls

tool: D10: ===To implement various Sorting Algorithms===
1. MergeSort
2. QuickSort
3. HeapSort
4. Exit
Enter your choice: 

tool: D39: %d

tool: D2: Sorted array is: 

tool: D68: Thank you for using


tool: D77: Invalid Choice please try again


tool: D12: Enter Size of array: 

tool: D14: Enter Array elements: 

assistant: ```c
int main() {
  int arr[50];
  int n, i;
  int choice;
  do {
    system("cls");
    printf("===To implement various Sorting Algorithms===\n"
           "1. MergeSort\n"
           "2. QuickSort\n"
           "3. HeapSort\n"
           "4. Exit\n"
           "Enter your choice: ");
    scanf("%d", &choice);
    if (choice < 4 && choice > 0) {
      printf("Enter Size of array: ");
      scanf("%d", &n);
      printf("Enter Array elements: ");
      for (i = 0; i < n; i++)
        scanf("%d", &arr[i]);
    }
    switch (choice) {
    case 1:
      mergeSort(arr, 0, n - 1);
      printf("Sorted array is: ");
      printArray(arr, n);
      break;
    case 2:
      quickSort(arr, 0, n - 1);
      printf("Sorted array is: ");
      printArray(arr, n);
      break;
    case 3:
      heapSort(arr, n - 1);
      printf("Sorted array is: ");
      printArray(arr, n);
      break;
    case 4:
      printf("Thank you for using\n");
      break;
    default:
      printf("Invalid Choice please try again\n");
      break;
    }
    getch();
  } while (choice != 4);
  return 0;
}
```