CFL with Empty Stack or Final State

Question

$1)$"We can solve same PDA with empty stack and using final state"

Can give an example of such language? Where is the difference between solving a pda with empty stak and by accepting final state?

I got this link but without example https://cs.stackexchange.com/questions/66924/push-down-automata-acceptance-by-empty-stack-and-final-state

$2)$If language has prefix property, why it cannot be solved with empty stack?

 

Comments

https://gateoverflow.in/165012/deterministic-pushdown-automata-prefix-property

 

---

I think the question should be particularly for DPDA, because for NPDA empty stack PDA is equivalent to final state accepting PDA.

---

Example Diffrence

---

https://gateoverflow.in/249558/acceptance-languages-dpda-with-empty-stack-npda-empty-stack