Text this: Optimal Hardness of Online Algorithms for Large Common Induced Subgraphs