<s>[INST] If we are given a graph with a total number of \(n\) vertices and \(m\) edges and an algorithm that has a time complexity of \(O(2^{n})\) and \(O(m\cdot n)\), how will the algorithm perform on large inputs?[/INST]