On the outer-connected reinforcement and bondage problems in bipartite graphs: the algorithmic complexity