It is possible to evaluate function arguments at the time of the call (eager evaluation) or at the time they are used (lazy evaluation). Most programming languages (including ML) use eager evaluation, but we can simulate lazy evaluation in an eager language such as ML by using higher-order functions. Consider a sequence data structure that starts with a value and continues with a function (known as a thunk) to compute the rest of the sequence:

Scenario: 1. victim opens the attacker's web site. 2. attacker sets up a web site which contains interesting and attractive content like 'do you want to make $1000 in a day? '. 3. victim clicks to the interesting and attractive content url. 4. attacker creates a transparent 'iframe' in front of the url which victim attempt to click, so victim thinks that he/she clicks to the 'do you want to make $1000 in a day? ' url but actually he/she clicks to the content or url that exists in the transparent 'iframe' which is setup by the attacker. what is the name of the attack which is mentioned in the scenario?