Here's the equivalent C code for the given MIPS assembly Fibonacci function:

```c
int fib(int n) {
    if (n <= 0) {
        return 0;  // Base case: fib(0) = 0
    } else if (n == 1) {
        return 1;  // Base case: fib(1) = 1
    } else {
        return fib(n - 1) + fib(n - 2);  // Recursive case
    }
}
```

The C code defines a function `fib` that takes an integer `n` as an argument and returns the Fibonacci number at position `n`. It follows a similar structure as the MIPS assembly code, handling the base cases and recursively calling the `fib` function for the remaining cases.

To use this C code, you can call the `fib` function with an integer argument and store the result in a variable:

```c
int result = fib(10);  // Example usage: Calculate the 10th Fibonacci number
printf("Result: %d\n", result);
```

This will calculate the 10th Fibonacci number using the `fib` function and print the result to the console.
spam fails_task lang_mismatch pii not_appropriate hate_speech sexual_content quality toxicity humor helpfulness creativity violence