Complexity of the Minimum Cost Homomorphism Problem for Semicomplete Digraphs with Possible Loops