A gentle man invites a party of (m+n) friends to a dinner & places m at one table`T_1` and n at another table `T_2`, the table being round. If not all people shall have the same neighbour in any two arrangements, then the number of ways in which h can arrange the guests, is :
`(m+n)C_n`
`1)((m-1)!)/2`
`2)((n-1)!)/2`
`((m+n)!)/(m!*n!)*((m-1)!)/2*((n-1)!)/2`
`((m+n)!)/(m*n*4)`
Option A is correct.