chore: Add test for recursing a foldable function (#4948)

# Description

## Problem\*

Resolves #4616 

## Summary\*

I wrote the initial issue for recursive calls a while ago. I thought I
had an error at the time and that is why I wrote the issue but it looks
to all be working for fibonacci example. This simply adds a test to
validate recursive ACIR calls.

## Additional Context



## Documentation\*

Check one:
- [ ] No documentation needed.
- [ ] Documentation included in this PR.
- [X] **[For Experimental Features]** Documentation to be submitted in a
separate PR.

# PR Checklist\*

- [X] I have tested the changes locally.
- [X] I have formatted the changes with [Prettier](https://prettier.io/)
and/or `cargo fmt` on default settings.

test_programs/execution_success/fold_fibonacci/Nargo.toml

@@ -0,0 +1,7 @@
+[package]
+name = "fold_fibonacci"
+type = "bin"
+authors = [""]
+compiler_version = ">=0.28.0"
+
+[dependencies]

test_programs/execution_success/fold_fibonacci/Prover.toml

@@ -0,0 +1 @@
+x = "10"

test_programs/execution_success/fold_fibonacci/src/main.nr

@@ -0,0 +1,12 @@
+fn main(x: u32) {
+    assert(fibonacci(x) == 55);
+}
+
+#[fold]
+fn fibonacci(x: u32) -> u32 {
+    if x <= 1 {
+        x
+    } else {
+        fibonacci(x - 1) + fibonacci(x - 2)
+    }
+}

tooling/debugger/ignored-tests.txt

@@ -20,3 +20,4 @@ fold_numeric_generic_poseidon
 no_predicates_basic
 no_predicates_numeric_generic_poseidon
 regression_4709
+fold_fibonacci