Consider a table 𝑇, where the elements 𝑇[𝑖][𝑗],0≤𝑖,𝑗≤𝑛, represent the cost of the optimal solutions of different subproblems of a problem that is being solved using a dynamic programming algorithm. The recursive formulation to compute the table entries is as follows:
T[0][𝑘]=𝑇[𝑘][0]=1       for 𝑘=0,1,2,…,𝑛
T[𝑖][𝑗]=2𝑇[𝑖−1][𝑗]+ 3𝑇[𝑖][𝑗−1]       for 1≤𝑖,𝑗≤𝑛
Consider the following two algorithms to compute entries of 𝑇. Assume that for both the algorithms, for all 0≤𝑖,𝑗≤𝑛, 𝑇[𝑖][𝑗] has been initialized to 1. Algorithm 𝐵_𝑘,𝑘∈{1,2} is said to be correct if and only if it calculates the correct values of 𝑇[𝑖][𝑗], for all 0≤𝑖,𝑗≤𝑛, (as per the recursive formulation) at the end of the execution of the algorithm 𝐵_𝑘. Which one of the following statements is true?