Question $3$

For the following array, fill the given table to show the steps of fibonacci search algorithm based on the implementation we have covered in lectures. The searching algorithm is also given in the appendix section. Please answer considering the variables names in the algorithm provided in the appendix section.

Use as many lines as needed in the table.

The key element that is being searched is $185.$

int arr $[],220,230,250,285,290,295,305$;

$\backslash$table$[[$i $($index$),$fibMMm$2,$fibMMm$1,$fibM,offset$],[-($initial step$),,,,-1],[,,,,],[,,,,],[,,,,],[,,,,],[,,,,],[,,,,],[,,,,]]$