Comparison between Hirschberg’s algorithm and Needleman-Wunsch algorithm in finding optimal alignment in terms of search space and time complexity