Dioscuss the below:
Q: Consider a table B that consists of m integers B [1], B [2] ... B [m]. Design an algorithm to produce a two-dimensional m × m table C such that each element C[i,j] for i
a) Design an algorithm that creates the table C according to the above description and has time complexity Θ(m3).
In response give either pseudocode or the description of the steps of the algorithm, and calculate the time complexity.
b) Design an algorithm that creates the table C according to the above description and has time complexity Θ(m2).
In response give either pseudocode or the description of the steps of the algorithm, and justify the time complexity.