Doubt in mcq question

#1

Q10. Greedy10
Complexity of checking whether “hello” can be made after deleting some characters of a given string. Find min Complexity and best Algorithm. Size of hello =5 Size of given String =15

O(5) greedy

O(15) DP

O(5 log 15) geedy

O(15) greedy

#2

answer should be O(15) greedy

i don’t think dp solution exist for this

#3

but how is it O(15)?

#4

n=15
and using greedy time complexity is O(n)
so it is O(15)

#5

okay, thank you .

#6

I think dp exist for this. as we have dp for finding supersequence problem we can find for this too.