You are given an array of non$-$negative integers that represent the amount forward you can move

from that index. Describe a pseudocode algorithm that will determine whether the last index of the

array is reachable from the first index.

For example, take the following array: $2,0,1,3,0,0$

Fromindex$0$wecangotoindex$1$or$2$

From index $1$ we cannot move forward

From index $2$ we can move forward $1$

From index $3$ we can move forward $1,2,$ or $3*$ From index $4$ we cannot move forward

From index $5$ we cannot move forward

We can get to the end by taking the following path $0->2->3->5.$

You must solve this problem using a greedy algorithm and give the runtime of your algorithm.