Once the suffix array is constructed, the short routine shown in Figure can be invoked fro...

Once the suffix array is constructed, the short routine shown in Figure can be invoked from Figure to create the longest common prefix array.

a. In the code, what does rank[i] represent?

---

b. Suppose that LCP[rank[i] ] = h. Show that LCP[rank[i+1] ] ≥ h − 1.

---

c. Show that the algorithm in Figure correctly computes the LCP array.

---

d. Prove that the algorithm in Figure runs in linear time.

Figure LCP array construction from suffix array