It's true that Bewakook must not be at position 1 in the queue, but it's not correct to multiple 9! for all 9 times. If Bewakoof was at position 4, and you use 9!, then there will be some permutations that have Vivek behind Bewakoof because 9! considers all possible arrangements.
Here's what I think:
If B is in queue position 2, then V must be at 1 --> number of ways = 8!
If B in in queue position 3, and V at 2 --> 8! ways
If B is in queue position 3, and V at 1 --> 8! ways
If B is in queue position 4, and V at 3 --> 8! ways
If B is in queue position 4, and V at 2 --> 8! ways
If B is in queue position 4, and V at 1 --> 8! ways
So for B in queue position 2 to position 9, we will have 8!(2+3+4+5+6+7+8)
For B in last position there are 9! ways to arrange since V will always be in front.
Total number of way = 36(8!) + 9!