user: Please show me the C implementation that matches the assembly code listed below:

```asm
<CheckSolution>:
  endbr64
  push   %r15
  push   %r14
  push   %r13
  push   %r12
  push   %rbp
  push   %rbx
  sub    $0x8,%rsp
  mov    (%rsi),%r15d
  test   %r15d,%r15d
  jne    L101
L65:
  add    $0x8,%rsp
  mov    %r15d,%eax
  pop    %rbx
  pop    %rbp
  pop    %r12
  pop    %r13
  pop    %r14
  pop    %r15
  ret
  nopl   0x0(%rax)
L101:
  mov    %rdi,%r13
  mov    %edx,%edi
  mov    %edx,%r14d
  mov    %rsi,%rbp
  call   <CreateIntMatrix@plt>
  lea    -0x1(%r14),%ebx
  mov    %rax,%r12
  test   %r14d,%r14d
  jle    L46
  mov    %r14d,%edi
  xor    %esi,%esi
  lea    0x0(,%rdi,4),%r15
  mov    %rax,%rdi
  mov    %r15,%rdx
  call   <memset@plt>
  mov    %r14d,%edi
  call   <CreateIntMatrix@plt>
  mov    %r12,%rdx
  lea    (%r12,%r15,1),%rdi
  mov    %rax,%r14
  movslq %ebx,%rax
  lea    0x0(%rbp,%rax,4),%rcx
  nopw   0x0(%rax,%rax,1)
L26:
  mov    (%rcx),%esi
  add    $0x4,%rdx
  sub    $0x4,%rcx
  mov    %esi,-0x4(%rdx)
  cmp    %rdx,%rdi
  jne    L26
L10:
  xor    %ecx,%ecx
  jmp    L47
  xchg   %ax,%ax
L50:
  cmp    $0x9,%edx
  jle    L25
  sub    $0xa,%edx
  mov    $0x1,%ecx
  mov    %edx,(%r14,%rax,4)
  cmp    %edx,0x0(%r13,%rax,4)
  jne    L64
L6:
  sub    $0x1,%rax
  test   %eax,%eax
  js     L19
L47:
  mov    0x0(%rbp,%rax,4),%edx
  add    (%r12,%rax,4),%edx
  cmp    $0x1,%ecx
  jne    L115
  add    $0x1,%edx
L115:
  mov    %edx,(%r14,%rax,4)
  test   %eax,%eax
  jne    L50
L25:
  xor    %ecx,%ecx
  cmp    %edx,0x0(%r13,%rax,4)
  je     L6
L64:
  xor    %r15d,%r15d
  jmp    L120
  cs nopw 0x0(%rax,%rax,1)
L46:
  mov    %r14d,%edi
  call   <CreateIntMatrix@plt>
  mov    %rax,%r14
  movslq %ebx,%rax
  test   %ebx,%ebx
  jns    L10
  nopw   0x0(%rax,%rax,1)
L19:
  mov    $0x1,%r15d
L120:
  mov    %r12,%rdi
  call   <free@plt>
  mov    %r14,%rdi
  call   <free@plt>
  jmp    L65
```

assistant: ```c
bool CheckSolution(int *Number, int *Solution, int NumberOfDigits) {
  if (Solution[0] == 0)
    return false;
  int count1 = 0, Carry = 0;
  int *Reverse = CreateIntMatrix(NumberOfDigits - count1);
  for (int counter = 0; counter < NumberOfDigits; counter++)
    Reverse[counter] = 0;
  int *PossibleNumber = CreateIntMatrix(NumberOfDigits);
  bool Valid = true;
  for (int count2 = 0; count2 < NumberOfDigits - count1; count2++) {
    Reverse[count2] = Solution[NumberOfDigits - 1 - count2 - count1];
  }
  for (int count2 = NumberOfDigits - 1; count2 >= count1; count2--) {
    PossibleNumber[count2] = Reverse[count2] + Solution[count2];
    if (Carry == 1) {
      PossibleNumber[count2] += 1;
      Carry = 0;
    }
    if (PossibleNumber[count2] >= 10 && count2 != 0) {
      PossibleNumber[count2] -= 10;
      Carry = 1;
    } else
      Carry = 0;
    if (PossibleNumber[count2] != Number[count2]) {
      Valid = false;
      break;
    }
  }
  while (count1 != 0) {
    count1--;
    PossibleNumber[count1] = Solution[count1];
    if (Carry == 1) {
      PossibleNumber[count1]++;
      Carry = 0;
    }
    if (PossibleNumber[count1] != Number[count1]) {
      Valid = false;
      break;
    }
  }
  free(Reverse);
  free(PossibleNumber);
  return Valid;
}
```