Task: Write a Java program which returns the pairs of related sailors (by names), starting from a database of the above schema. You are NOT
allowed to use recursive SQL. Do not list sailors with themselves (i.e. no (Pop-eye,Popeye)), and for every listed pair do not list its swapped version (i.e. if
you list (Popeye, Jane) do not list (Jane, Popeye)).